A note on a result in the theory of code construction

DOI10.1016/S0019-9958(59)90376-6MaRDI QIDQ3262635zbMATH OpenOpenAlexDBLPWikidataFDO

Authors R. C. Bose, S. S. Shrikhande

Publication date 1959

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(59)90376-6

zbMATH Keywords

Hadamard matrixmaximal codesymmetric incomplete block design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Statistical block designs (62K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(15)

• Algebraic theory of block codes detecting independent errors
• Unrestricted codes with the Golay parameters are unique
• Applying computer algebra systems with SAT solvers to the Williamson conjecture
• A coding theorem for enumerable output machines
• Neue Hadamard-Matrizen
• Determinantenabschätzungen für binäre Matrizen. (Estimation of determinants for binary matrices)
• A modal Θ-valent approach of the notion of code
• ON PLOTKIN-OPTIMAL CODES OVER FINITE FROBENIUS RINGS
• On the Construction of (Explicit) Khodak's Code and Its Analysis
• Plotkin's conjectures regarding decompositions D(4k, 4)
• Generalized Hadamard Matrices
• Asymptotic bounds on the equilateral dimension of hypercubes
• On constructions of regular Hadamard matrices and bent functions
• Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
• On the construction of q-ary equidistant codes

This page was built for publication: A note on a result in the theory of code construction

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