Skip to main content
Journal cover image

Covering machines

Publication ,  Journal Article
Calderbank, AR
Published in: Discrete Mathematics
September 1, 1992

We construct 2-state covering machines from binary linear codes with a sufficiently rich subcode structure. The goal is to trade multiple covering properties for increased redundancy. We explain why the expected covering properties of covering machines should be superior to those of codes obtained by iterating the ADS construction. © 1992.

Duke Scholars

Published In

Discrete Mathematics

DOI

ISSN

0012-365X

Publication Date

September 1, 1992

Volume

106-107

Issue

C

Start / End Page

105 / 110

Related Subject Headings

  • Computation Theory & Mathematics
  • 0802 Computation Theory and Mathematics
  • 0102 Applied Mathematics
  • 0101 Pure Mathematics
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Calderbank, A. R. (1992). Covering machines. Discrete Mathematics, 106107(C), 105–110. https://doi.org/10.1016/0012-365X(92)90536-O
Calderbank, A. R. “Covering machines.” Discrete Mathematics 106–107, no. C (September 1, 1992): 105–10. https://doi.org/10.1016/0012-365X(92)90536-O.
Calderbank AR. Covering machines. Discrete Mathematics. 1992 Sep 1;106–107(C):105–10.
Calderbank, A. R. “Covering machines.” Discrete Mathematics, vol. 106–107, no. C, Sept. 1992, pp. 105–10. Scopus, doi:10.1016/0012-365X(92)90536-O.
Calderbank AR. Covering machines. Discrete Mathematics. 1992 Sep 1;106–107(C):105–110.
Journal cover image

Published In

Discrete Mathematics

DOI

ISSN

0012-365X

Publication Date

September 1, 1992

Volume

106-107

Issue

C

Start / End Page

105 / 110

Related Subject Headings

  • Computation Theory & Mathematics
  • 0802 Computation Theory and Mathematics
  • 0102 Applied Mathematics
  • 0101 Pure Mathematics