A note on binary completely regular codes with large minimum distance

preprint2012arXivOpen access

Abstract

We classify all binary error correcting completely regular codes of length nn with minimum distance δ>n/2δ>n/2.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.