Maximal<tex>q</tex>-nary linear codes with large minimum distance (Corresp.)

DOI10.1109/TIT.1975.1055315MaRDI QIDQ4045941zbMATHOpenAlexFDO

Authors Arvind M. Patel

Publication date 1975

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

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

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(8)

• Simplex and MacDonald codes over \(R_q\)
• Binary and ternary LCD codes from projective spaces
• Complete weight enumerator of torsion codes
• MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\)
• Unit \(\mathbb{Z}_q\)-simplex codes of type \(\alpha\) and zero divisor \(\mathbb{Z}_q\)-simplex codes
• On generalized MacDonald codes
• Partial permutation decoding for MacDonald codes
• A survey on proper codes

This page was built for publication: Maximal&lt;tex&gt;q&lt;/tex&gt;-nary linear codes with large minimum distance (Corresp.)

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