Covering machines

Published

Journal Article

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.

Full Text

Duke Authors

Cited Authors

  • Calderbank, AR

Published Date

  • September 1, 1992

Published In

Volume / Issue

  • 106-107 / C

Start / End Page

  • 105 - 110

International Standard Serial Number (ISSN)

  • 0012-365X

Digital Object Identifier (DOI)

  • 10.1016/0012-365X(92)90536-O

Citation Source

  • Scopus