Group block codes over nonabelian groups are asymptotically bad

DOI10.1109/18.508859zbMath0856.94027OpenAlexW2129522054MaRDI QIDQ4885748

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

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

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) Combined modulation schemes (including trellis codes) in coding theory (94B12) Other types of codes (94B60)

Related Items (1)

Classic and Quantum Error Correcting Codes

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