On components of the Kerdock codes and the dual of the BCH code \(C_{1, 3}\)

DOI10.1016/j.disc.2019.111668zbMath1434.94088arXiv1810.04367OpenAlexW2978103510MaRDI QIDQ2279991

Ivan Yu. Mogilnykh, Faina I. Solov'eva

Publication date: 17 December 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.04367

zbMATH Keywords

association scheme\(t\)-designBCH codeuniformly packed codeKerdock code\(i\)-component

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30)

Cites Work

• Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Association schemes related to Kasami codes and Kerdock sets
• On explicit minimum weight bases for extended cyclic codes related to Gold functions
• A class of low-rate nonlinear binary codes
• An exponential number of generalized Kerdock codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Explicit Low-Weight Bases for BCH Codes
• Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On components of the Kerdock codes and the dual of the BCH code \(C_{1, 3}\)