Binary set functions and parity check matrices

DOI10.1016/0012-365X(90)90245-DzbMath0701.94011OpenAlexW2131922235MaRDI QIDQ914651

W. Edwin Clark, Douglas G. Rogers, Larry A. Dunning

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90245-d

zbMATH Keywords

linear codeparity check matrixbinary set functionminimum Hamming distanceunequal error protection codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (4)

The number of additive triples in subsets of abelian groups ⋮ Blocking sets in finite projective spaces and uneven binary codes ⋮ Stability result for sets with \(3A \neq \mathbb{Z}_5^n\) ⋮ Sum-free sets in vector spaces over \(GF(2)\)

Uses Software

• SEC-DED

Cites Work

• Unnamed Item
• Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classes
• An updated table of minimum-distance bounds for binary linear codes
• Optimal encodings of linear block codes for unequal error protection

This page was built for publication: Binary set functions and parity check matrices