On the Preparata and Goethals codes
From MaRDI portal
Publication:3671887
DOI10.1109/TIT.1983.1056675zbMath0521.94015OpenAlexW2066583820MaRDI QIDQ3671887
Richard M. Wilson, Ronald D. Baker, J. H. van Lint
Publication date: 1983
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1983.1056675
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, A linear construction for certain Kerdock and Preparata codes, A family of antipodal distance-regular graphs related to the classical Preparata codes, Representation of \(\mathbb Z_4\)-linear preparata codes using vector fields, Jack van Lint (1932--2004): a survey of his scientific work, Some new results on the conjecture on exceptional APN functions and absolutely irreducible polynomials: the Gold case, The Automorphism Groups of the Kerdock Codes, The chromatic index of finite projective spaces, New lower bounds for partial k‐parallelisms, Galois geometries and coding theory, Perfect codes with distinct protective radii, Completely regular codes and completely transitive codes, Orthogonal quadruple systems and 3-frames, On completely regular codes, On the Delsarte-Goethals codes and their formal duals, On diameter perfect constant-weight ternary codes, APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\), 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, Kerdock codes and related planes, The automorphism groups of the Delsarte-Goethals codes, On the classification of binary completely transitive codes with almost-simple top-group, Partial ‐Parallelisms in Finite Projective Spaces, On cryptographic propagation criteria for Boolean functions
