On the non-abelian group code capacity of memoryless channels
From MaRDI portal
Recommendations
- On the uncontrollability of nonabelian group codes with uncoded group \(\mathbb Z_p\)
- Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels
- Group block codes over nonabelian groups are asymptotically bad
- New Examples of Non-Abelian Group Codes
- On the Hamming distance properties of group codes
Cites work
- Abelian Group Codes for Channel Coding and Source Coding
- Analysis of Serial Turbo Codes over Abelian Groups for Symmetric Channels
- Average spectra and minimum distances of low-density parity-check codes over Abelian groups
- Convolutional codes over groups
- Elements of Information Theory
- Geometrically uniform codes
- Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels
- Group Codes for the Gaussian Channel
- Group codes generated by finite reflection groups
- Group Codes Outperform Binary-Coset Codes on Nonbinary Symmetric Memoryless Channels
- Group Coding With Complex Isometries
- scientific article; zbMATH DE number 5995471 (Why is no real title available?)
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- Random coding techniques for nonrandom codes
- Reflection Group Codes and Their Decoding
- Signal sets matched to groups
Cited in
(4)
This page was built for publication: On the non-abelian group code capacity of memoryless channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194504)