• DocumentCode
    2626974
  • Title

    Linear binary completely regular codes with distance 2

  • Author

    Eva, Anastasia Vasil

  • Author_Institution
    Sobolev Inst. of Math., Novosibirsk
  • fYear
    2008
  • fDate
    21-25 July 2008
  • Firstpage
    12
  • Lastpage
    15
  • Abstract
    We investigate completely regular codes with the small code distance. These codes are interesting because they play the role of natural subcodes of some good codes. The construction of the linear completely regular code with code distance 2 is given. The connected components of the graph of minimal distances of a linear completely regular code is described. The structure of a linear completely regular code with code distance 2 is studied.
  • Keywords
    binary codes; graph theory; linear codes; code distance 2; graph theory; linear binary completely regular codes; Region 8;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Technologies in Electrical and Electronics Engineering, 2008. SIBIRCON 2008. IEEE Region 8 International Conference on
  • Conference_Location
    Novosibirsk
  • Print_ISBN
    978-1-4244-2133-6
  • Electronic_ISBN
    978-1-4244-2134-3
  • Type

    conf

  • DOI
    10.1109/SIBIRCON.2008.4602615
  • Filename
    4602615
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2626974