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

DOI10.1109/TIT.1975.1055315zbMath0293.94004OpenAlexW1997005433MaRDI QIDQ4045941

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)

Related Items (8)

Complete weight enumerator of torsion codes ⋮ Simplex and MacDonald codes over \(R_q\) ⋮ Unnamed Item ⋮ Partial permutation decoding for MacDonald codes ⋮ Binary and ternary LCD codes from projective spaces ⋮ On generalized MacDonald codes ⋮ A survey on proper codes ⋮ MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\)

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