“Some results for linear binary codes with minimum distance 5 and 6”


Върбанов, Златко (2005) “Some results for linear binary codes with minimum distance 5 and 6” IEEE Transactions on Information Theory, Vol.51, Issue 12, pp.4387-4391, ISSN 0018-9448, https://www.scopus.com/record/display.uri?eid=2-s2.0-29144476543&origin=resultslist&sort=plf-f&src=s&sid=a5ab8b39e997560908779cab035929a0&sot=autdocs&sdt=autdocs&sl=18&s=AU-ID%2856618122100%29&relpos=3&citeCnt=1&searchTerm=


 We prove that a linear binary code with parameters [34,24,5] does not exist. Also, we characterize some codes with minimum distance 5 and 6.
  Статия
 linear code, algorithm, binary code


Природни науки, математика и информатика

Natural sciences, mathematics and informatics

 Издадено
  22156
 Златко Върбанов

4. Feulner, Thomas, "Classification and nonexistence results for linear codes with prescribed minimum distances", Designs, Codes and Cryptography, Volume 70, Issue 1–2, January 2014, pp. 127–138

3. Bouyukliev, Iliya., Jacobsson, Eric, "Results on Binary Linear Codes With Minimum Distance 8 and 10", IEEE Transactions on Information Theory 57(9), 2011, pp.6089-6093

2. St.Bouyuklieva, I.Bouyukliev, "Classification of the extremal formally self-dual even codes of length 30", Advances in Mathematics of Communications 4(3), August 2010, pp.433-439

1. M.Karpovsky, K.Kulikowski, Zh.Wang, "ROBUST ERROR DETECTION IN COMMUNICATION AND COMPUTATIONAL CHANNELS", in Spectral Methods and Multirate Signal Processing. SMMSP’2007. International Workshop on , Citeseer, 2007.

Научният архив поддържа инициативата за отворен достъп OAI 2.0 с начален адрес: http://da.uni-vt.bg/oai2/