Weight distribution and dual distance

DOI10.1007/BF01438280zbMath0794.94015OpenAlexW2147189296MaRDI QIDQ1320444

Patrick Solé

Publication date: 30 August 1994

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

Full work available at URL: https://doi.org/10.1007/bf01438280

zbMATH Keywords

upper boundsorthogonal polynomialsKrawtchouk polynomialsself-dual codesminimum distancedual distancelinear binary codeextreme weightsPless identities

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Covering radius and dual distance
• Upper bounds for the cardinality of s-distances codes
• Artin-Schreier curves, exponential sums, and the Carlitz-Uchiyama bound for geometric codes
• Polynomial description of binary linear codes and related properties
• A new upper bound on the minimal distance of self-dual codes
• Asymptotic bounds on the covering radius of binary codes
• On the spectra of the duals of binary BCH codes of designed distance delta =9
• On the covering radius of binary codes (Corresp.)
• Four fundamental parameters of a code and their combinatorial significance
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weight distribution and dual distance