Decomposing and shortening codes using automorphisms (Corresp.)

DOI10.1109/TIT.1986.1057233zbMATH Open0611.94009MaRDI QIDQ3752295FDOQ3752295

W. Cary Huffman

Publication date: 1986

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

zbMATH Keywords

direct sumshorter length codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (4)

• On the automorphisms of order 15 for a binary self-dual \([96, 48, 20]\) code
• Constructing covering codes with given automorphisms
• Binary isodual codes having an automorphism of odd prime order
• On the structure of the linear codes with a given automorphism

   Recommendations

• Shortening of codes 👍 👎
• On the (24, 12, 10) quaternary code and binary codes with an automorphism having two cycles 👍 👎
• Title not available (Why is that?) 👍 👎
• On the decomposition of self-dual codes over \(\mathbb F_2 + u\mathbb F_2\) with an automorphism of odd prime order 👍 👎
• On extremal self-dual quaternary codes of lengths 18 to 28. I 👍 👎

This page was built for publication: Decomposing and shortening codes using automorphisms (Corresp.)

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