This site is supported by donations to The OEIS Foundation.



Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A265032 Maximal size of an error-correcting code of length n and minimal distance 3 over an alphabet of size 4. 9
1, 1, 4, 16, 64 (list; graph; refs; listen; history; text; internal format)



The alphabet may be any set of size 4 (GF(4), Z/4Z, etc.) so there is no requirement of linearity.

a(6) is known to be in the range [164-179], and a(7) in the range [512-614].


Table of n, a(n) for n=1..5.

N. J. A. Sloane, Challenge Problems: Independent Sets in Graphs

R. Barden, N. Bushaw, C. Callison, A. Fernandez, B. Harris, I. Holden, C. E. Larson, D. Muncy, C. O'Shea, J. Shive, J. Raines, P. Rana, N. van Cleemput, B. Ward, N. Wilcox-Cook, The Graph Brain Project & Big Mathematics, research paper, 2017.

Galina T. Bogdanova, Andries E. Brouwer, Stoian N. Kapralov and Patric R.J. Ostergard, Error-Correcting Codes over an Alphabet of Four Elements, Designs, Codes and Cryptography 23 (2001) 333-342.

Oleksandra Yezerska, Sergiy Butenko, The Maximum Clique and Vertex Coloring, Handbook of Heuristics. Springer, Cham, 2018, 1-31.


Sequence in context: A282310 A022030 A135450 * A162547 A073533 A061283

Adjacent sequences:  A265029 A265030 A265031 * A265033 A265034 A265035




N. J. A. Sloane, Dec 05 2015



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 05:30 EST 2019. Contains 319269 sequences. (Running on oeis4.)