Rook domains, Latin squares, affine planes, and error-distributing codes
From MaRDI portal
Publication:5737513
DOI10.1109/TIT.1964.1053680zbMath0124.11404OpenAlexW2095042881MaRDI QIDQ5737513
Solomon W. Golomb, Edward C. Posner
Publication date: 1964
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1964.1053680
Related Items (20)
On the non-existence of extended 1-perfect codes and MDS codes ⋮ Orthogonal F-rectangles, orthogonal arrays, and codes ⋮ New upper bounds for binary covering codes ⋮ Combinatorial methods in the construction of point sets with uniformity properties ⋮ On the extendability of code isometries ⋮ Algebraic theory of block codes detecting independent errors ⋮ Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\) ⋮ Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\) ⋮ Perfect 2‐colorings of Hamming graphs ⋮ MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ Hyper-rook Domain Inequalities ⋮ Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\) ⋮ Packing Centrosymmetric Patterns of n Nonattacking Queens on an n×n Board ⋮ Mutually orthogonal Latin squares based on cellular automata ⋮ On covering sets and error-correcting codes ⋮ Fundamentals of coding type problems ⋮ Bounds for covering codes over large alphabets ⋮ Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\) ⋮ On covering and coloring problems for rook domains
This page was built for publication: Rook domains, Latin squares, affine planes, and error-distributing codes
