Title of article
A note on binary completely regular codes with large minimum distance
Author/Authors
Gillespie، نويسنده , , Neil I.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
3
From page
1532
To page
1534
Abstract
We classify all binary error correcting completely regular codes of length n with minimum distance δ > n / 2 .
Keywords
Hamming codes , equidistant codes , Completely regular codes
Journal title
Discrete Mathematics
Serial Year
2013
Journal title
Discrete Mathematics
Record number
1600360
Link To Document