A class of majority logic decodable codes (Corresp.)
From MaRDI portal
Publication:5531453
DOI10.1109/TIT.1967.1053994zbMath0152.15410MaRDI QIDQ5531453
Publication date: 1967
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
Self-orthogonal codes from the strongly regular graphs on up to 40 vertices ⋮ On the stopping distance of LDPC codes based on symplectic space over finite fields ⋮ Linearly embeddable designs ⋮ Unnamed Item ⋮ Algebraic theory of block codes detecting independent errors ⋮ Affine geometry designs, polarities, and Hamada's conjecture ⋮ Minimal codewords arising from the incidence of points and hyperplanes in projective spaces ⋮ A Hamada type characterization of the classical geometric designs ⋮ Self-orthogonal designs and codes from the symplectic groups S\(_4\)(3) and S\(_4\)(4) ⋮ Cyclic quasi-symmetric designs and self-orthogonal codes of length 63 ⋮ On the BIB design having the minimum p-rank ⋮ Codes arising from incidence matrices of points and hyperplanes in \(\mathrm{PG}(n, q)\) ⋮ Ranks of incidence matrices of Steiner triple systems ⋮ On the code generated by the incidence matrix of points and hyperplanes in \(\text{PG}(n,q)\) and its dual ⋮ Polarities, quasi-symmetric designs, and Hamada's conjecture ⋮ Maximal arcs, codes, and new links between projective planes of order 16 ⋮ Moderate-density parity-check codes from projective bundles ⋮ On the classification of unitals on 28 points of low rank
