A note on binary completely regular codes with large minimum distance

Abstract

We classify all binary error correcting completely regular codes of length n with minimum distance δ > n/2. 
DOI: 10.1016/j.disc.2013.03.016

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics