"Ultra-Low Complexity Communication Algorithms Based on (n, n(n-l), n-l) PGCs."

Li Peng (2024)

> Home

Details and statistics

DOI: 10.1109/ITW61385.2024.10807038

access: closed

type: Conference or Workshop Paper

metadata version: 2025-02-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/itw/Peng24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itw/Peng24
Li Peng:
Ultra-Low Complexity Communication Algorithms Based on (n, n(n-l), n-l) PGCs. ITW 2024: 418-423

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.