Polynomial description of binary linear codes and related properties

DOI10.1007/BF01810572zbMath0748.94005MaRDI QIDQ1181004

Jacques Wolfmann

Publication date: 27 June 1992

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

trace functionpolynomials over finite fieldsbinary projective linear code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (1)

Weight distribution and dual distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weights of the dual code of the MELAS code over GF(3)
• Codes projectifs à deux ou trois poids associes aux hyperquadriques d'une géométrie finie
• Codes projectifs à deux poids, caps complets et ensembles de différences
• Perfect codes and the Mathieu groups
• The number of points on certain algebraic curves over finite fields
• The weights of the orthogonals of the extended quadratic binary Goppa codes
• A duality theorem for the weight distribution of some cyclic codes
• The weight distributions of some minimal cyclic codes (Corresp.)
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Weights of cyclic codes
• A New Treatment of Bose-Chaudhuri Codes
• Weights of irreducible cyclic codes

This page was built for publication: Polynomial description of binary linear codes and related properties