A class of optimum nonlinear double-error-correcting codes
From MaRDI portal
Publication:5554779
DOI10.1016/S0019-9958(68)90874-7zbMath0167.47702MaRDI QIDQ5554779
Publication date: 1968
Published in: Information and Control (Search for Journal in Brave)
Related Items
Generalized Preparata codes and 2-resolvable Steiner quadruple systems, On perfect codes that do not contain Preparata-like codes, On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code, An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions, A linear construction for certain Kerdock and Preparata codes, On the minimum distance graph of an extended Preparata code, Symplectic spread-based generalized Kerdock codes, \(\mathbb{Z}_ 4\)-linear codes obtained as projections of Kerdock and Delsarte-Goethals codes, Representation of \(\mathbb Z_4\)-linear preparata codes using vector fields, Jack van Lint (1932--2004): a survey of his scientific work, The Automorphism Groups of the Kerdock Codes, Algebraic theory of block codes detecting independent errors, Enumeration of Kerdock codes of length 64, New ring-linear codes from dualization in projective Hjelmslev geometries, Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\), On the Delsarte-Goethals codes and their formal duals, On diameter perfect constant-weight ternary codes, NONBINARY DELSARTE–GOETHALS CODES AND FINITE SEMIFIELDS, COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES, On the automorphism groups of the \(\mathbb Z_2\mathbb Z_4\)-linear 1-perfect and Preparata-like codes, Propelinear codes related to some classes of optimal codes, A general case of formal duality between binary nonlinear codes, Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\), Partitioning the planes of \(AG_{2m}(2)\) into 2-designs, Nearly perfect codes in distance-regular graphs, Оценки объемов окрестностей двоичных кодов в терминах их весовых спектров, A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters, Symplectic semifield planes and ℤ₄–linear codes, The automorphism groups of the Delsarte-Goethals codes, On the generalized concatenated construction for the Nordstrom-Robinson code and the binary Golay code, A survey of constructive coding theory, and a table of binary codes of highest known rate, Nearly perfect binary codes, A construction scheme for linear and non-linear codes, On the error-detecting performance of some classes of block codes
