2000 character limit reached
A note on binary completely regular codes with large minimum distance
Published 24 Oct 2012 in math.CO, cs.IT, and math.IT | (1210.6459v1)
Abstract: We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta>n/2$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.