Constraints on weights in binary codes

DOI10.1007/S002000050079MaRDI QIDQ1360994zbMATH OpenOpenAlexFDO

Authors V. Pless

Publication date 23 July 1997

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

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

zbMATH Keywords

weightsdoubly-evensingly-even

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Some restrictions on weight enumerators of singly even self-dual codes. II
• scientific article; zbMATH DE number 1057273
• Some restrictions on weight enumerators of singly even self-dual codes
• Higher weights and binary self-dual codes

Cited in

(5)

• A lemma on binomial coefficients and applications to Lee weights modulo 2e of codes over Z₄
• Even poset and a parity result for binary linear code
• Formally self-dual additive codes over \(\mathbb F_4\)
• On the cost of worst case coding length constraints
• Weights modulo \(p^e\) of linear codes over rings

This page was built for publication: Constraints on weights in binary codes

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