Fetching the paper…

Reading the bibliography…

2012

A note on binary completely regular codes with large minimum distance

Gillespie, Neil I.

Original
PDF
Post on X

Understand

We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta>n/2$.

A note on binary completely regular codes with large minimum distance · Around

Built on

Nothing clear enough to list yet.

Similar

Nothing clear enough to list yet.

Then

Nothing clear enough to list yet.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…