Covering machines. (English) Zbl 0754.94006
Summary: We construct 2-state converging 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.
References:
| [1] | Calderbank, A. R., Covering bounds for codes, J. Combin. Theory Ser. A, 60, 117-122 (1992) · Zbl 0744.94026 |
| [2] | Calderbank, A. R.; Fishburn, P. C., The second moment of a convolutional code (1991), Preprint · Zbl 0803.94020 |
| [3] | Graham, R. L.; Sloane, N. J.A., On the covering radius of codes, IEEE Trans. Inform. Theory, 31, 385-401 (1985) · Zbl 0585.94012 |
| [4] | Honkala, I. S., Modified bounds for covering codes, IEEE Trans. Inform. Theory, 372-375 (1991) · Zbl 0721.94013 |
| [5] | Simonis, J., The minimal covering radius \(t\)[15,6] of a six-dimensional binary linear code of length 15 is equal to 4, IEEE Trans. Inform. Theory, 34, 1344-1345 (1988) · Zbl 0665.94012 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
