Note on the size of binary Armstrong codes

A. Blokhuis; A.E. Brouwer; A. Sali

doi:10.1007/s10623-012-9711-5

Note on the size of binary Armstrong codes

A. Blokhuis, A.E. Brouwer, A. Sali

Discrete Algebra and Geometry

Research output: Contribution to journal › Article › Academic › peer-review

2 Citations (Scopus)

1 Downloads (Pure)

Abstract

We show for binary Armstrong codes Arm(2, k, n) that asymptotically n/k = 1.224, while such a code is shown to exist whenever n/k = 1.12. We also construct an Arm(2, n - 2, n) and Arm(2, n - 3, n) for all admissible n. Keywords: Coding theory; Databases; Armstrong codes

Original language	English
Pages (from-to)	1-4
Number of pages	4
Journal	Designs, Codes and Cryptography
Volume	71
Issue number	1
DOIs	https://doi.org/10.1007/s10623-012-9711-5
Publication status	Published - 2014

Access to Document

10.1007/s10623-012-9711-5

Cite this

@article{9e9b8092016441e7b77f444f4c8c4126,

title = "Note on the size of binary Armstrong codes",

abstract = "We show for binary Armstrong codes Arm(2, k, n) that asymptotically n/k = 1.224, while such a code is shown to exist whenever n/k = 1.12. We also construct an Arm(2, n - 2, n) and Arm(2, n - 3, n) for all admissible n. Keywords: Coding theory; Databases; Armstrong codes",

author = "A. Blokhuis and A.E. Brouwer and A. Sali",

year = "2014",

doi = "10.1007/s10623-012-9711-5",

language = "English",

volume = "71",

pages = "1--4",

journal = "Designs, Codes and Cryptography",

issn = "0925-1022",

publisher = "Springer",

number = "1",

}

TY - JOUR

T1 - Note on the size of binary Armstrong codes

AU - Blokhuis, A.

AU - Brouwer, A.E.

AU - Sali, A.

PY - 2014

Y1 - 2014

N2 - We show for binary Armstrong codes Arm(2, k, n) that asymptotically n/k = 1.224, while such a code is shown to exist whenever n/k = 1.12. We also construct an Arm(2, n - 2, n) and Arm(2, n - 3, n) for all admissible n. Keywords: Coding theory; Databases; Armstrong codes

AB - We show for binary Armstrong codes Arm(2, k, n) that asymptotically n/k = 1.224, while such a code is shown to exist whenever n/k = 1.12. We also construct an Arm(2, n - 2, n) and Arm(2, n - 3, n) for all admissible n. Keywords: Coding theory; Databases; Armstrong codes

U2 - 10.1007/s10623-012-9711-5

DO - 10.1007/s10623-012-9711-5

M3 - Article

SN - 0925-1022

VL - 71

SP - 1

EP - 4

JO - Designs, Codes and Cryptography

JF - Designs, Codes and Cryptography

IS - 1

ER -

Note on the size of binary Armstrong codes

Abstract

Access to Document

Fingerprint

Cite this