Group block codes over nonabelian groups are asymptotically bad

DOI10.1109/18.508859zbMATH Open0856.94027OpenAlexW2129522054MaRDI QIDQ4885748FDOQ4885748

Authors: J. Carmelo Interlando, Reginaldo jun. Palazzo, Michele Elia 

Publication date: 25 February 1997

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.508859

Recommendations

• Group codes over fields are asymptotically good
• scientific article; zbMATH DE number 5588563
• On the Hamming distance properties of group codes
• On the non-abelian group code capacity of memoryless channels

zbMATH Keywords

group homomorphismEuclidean-space codesfactorizable and decomposable groupsgroup codes over nonabelian groups

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Linear codes (general theory) (94B05) Other types of codes (94B60) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Cited In (7)

• Group codes over fields are asymptotically good
• On the uncontrollability of nonabelian group codes with uncoded group \(\mathbb Z_p\)
• Multilevel construction of block and trellis group codes
• Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels
• Classic and Quantum Error Correcting Codes
• Title not available (Why is that?)
• On the non-abelian group code capacity of memoryless channels

This page was built for publication: Group block codes over nonabelian groups are asymptotically bad

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