Corpus ID: 7665767

Sixteen New Linear Codes With Plotkin Sum

@article{Hernando2008SixteenNL,
  title={Sixteen New Linear Codes With Plotkin Sum},
  author={F. Hernando and D. Ruano},
  journal={ArXiv},
  year={2008},
  volume={abs/0804.3507}
}
  • F. Hernando, D. Ruano
  • Published 2008
  • Mathematics, Computer Science
  • ArXiv
  • Sixteen new linear codes are presented: three of them improve the lower bounds on the minimum distance for a linear code and the rest are an explicit construction of unknown codes attaining the lower bounds on the minimum distance. They are constructed using the Plotkin sum of two linear codes, also called $(u|u+v)$ construction. The computations have been achieved using an exhaustiv search. 

    Topics from this paper.

    Skew Cyclic codes over $\F_q+u\F_q+v\F_q+uv\F_q$
    4

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES
    Bounds on the minimum distance of linear code s
    • 2007
    Bounds on the minimum distance of linear codes
    • 2007
    The Magma Algebra System I: The User Language
    5101
    Macwilliams and N . Sloane , The Theory of Error - Correcting Codes , ser . North - Holland mathematical library
    • 1977
    The Theory of Error-Correcting Codes
    5805
    New family of single-error correcting codes
    31
    Binary codes with specified minimum distance
    218
    Bounds on the minimum distance of linear codes