A New Approach to the Kasami Codes of Type 2

  title={A New Approach to the Kasami Codes of Type 2},
  author={Minjia Shi and Denis S. Krotov and Patrick Sol{\'e}},
  journal={IEEE Transactions on Information Theory},
  • M. Shi, D. Krotov, P. Solé
  • Published 28 September 2018
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
The dual of the Kasami code of length <inline-formula> <tex-math notation="LaTeX">$q^{2}-1$ </tex-math></inline-formula>, with <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula> a power of 2, is constructed by concatenating a cyclic MDS code of length <inline-formula> <tex-math notation="LaTeX">$q+1$ </tex-math></inline-formula> over <inline-formula> <tex-math notation="LaTeX">$F_{q}$ </tex-math></inline-formula> with a Simplex code of length <inline-formula> <tex-math… Expand
1 Citations


On the Classification of MDS Codes
It is shown that every (k + d - 1, q<sup>k</sup>, d)<sub>q</sub> code with k ≥3, d ≥ 3, q ∈ (5, 7} is equivalent to a linear code with the same parameters. Expand
Families of nested completely regular codes and distance-regular graphs
In this paper infinite families of linear binary nested completely regular codes are constructed and gives antipodal covers of some distance-regular and distance-transitive graphs. Expand
Completely regular codes with different parameters giving the same distance-regular coset graphs
For any prime power $q$ and any two natural numbers, it is shown that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters. Expand
Coding Theory and Applications, Second International Castle Meeting, ICMCTA 2008, Castillo de la Mota, Medina del Campo, Spain, September 15-19, 2008. Proceedings
A Diametric Theorem in for Lee and Related Distances.- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3).- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm.-Expand
Fundamentals of Error-Correcting Codes
This chapter discusses the development of soft decision and iterative decoding in linear codes, as well as some of the techniques used in convolutional codes. Expand
Theory of Error-correcting Codes
The field of channel coding started with Claude Shannon's 1948 landmark paper. Fifty years of efforts and invention have finally produced coding schemes that closely approach Shannon's channelExpand
Completely regular codes by concatenating Hamming codes
This work constructs new families of completely regular codes by concatenation methods by combining parity check matrices of cyclic Hamming codes and finds some non-equivalentcompletely regular codes, over the same finite field, with the same parameters and intersection array. Expand
Completely regular codes and completely transitive codes
  • P. Solé
  • Computer Science, Mathematics
  • Discret. Math.
  • 1990
The class of completely transitive codes which seems to be strictly contained in the class ofcompletely regular codes is introduced, including the nonlinear extended Preparata and Goethals codes. Expand
On the Kronecker Product Construction of Completely Transitive q-Ary Codes
For any integer ρ? 1 and for any prime power q, the explicit construction of an infinite family of completely transitive (and completely regular) q-ary codes with minimum distance d= 3 and withExpand
Completely regular codes
  • A. Neumaier
  • Computer Science, Mathematics
  • Discret. Math.
  • 1992
This paper shows that the basic theory—including Lloyd's theorem—can be obtained very elegantly by methods inspired from the theory of distance regular graphs. Expand