On the performance of permutation codes for multi-user communication

DOI10.1023/A:1026110514701MaRDI QIDQ2487095zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 17 August 2005

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1026110514701

zbMATH Keywords

bipartite graphFFH/MFSK modulationHamiltonian cycle

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Modulation and demodulation in information and communication theory (94A14) Coding theorems (Shannon theory) (94A24) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• Permutation codes for the Gaussian broadcast channel with two receivers
• A new table of permutation codes
• Permutation codes with specified packing radius
• Constructions for permutation codes in powerline communications
• Diagonally neighbour transitive codes and frequency permutation arrays

Cited in

(8)

• Constructions for permutation codes in powerline communications
• On the Capacity of Constrained Permutation Codes for Rank Modulation
• scientific article; zbMATH DE number 4016763 (Why is no real title available?)
• An iterative code construction and codes generated by permutations for the asymmetric multiple-access channel (Corresp.)
• Permutation codes for the Gaussian broadcast channel with two receivers
• A note on permutation modulation
• Codes in the Space of Multisets—Coding for Permutation Channels With Impairments
• Comments on ``Performance analysis for ordered selection combining schemes in Nakagami-m environments

This page was built for publication: On the performance of permutation codes for multi-user communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487095)