Loading…
A polynomial construction of perfect codes
Starting with a single-error-correcting extended perfect binary systematic code of length S, one can construct a single-error-correcting extended perfect binary systematic code of length S2 S by polynomial manipulations.
Saved in:
Published in: | Computers & mathematics with applications (1987) 1997-04, Vol.33 (8), p.127-131 |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Starting with a single-error-correcting extended perfect binary systematic code of length
S, one can construct a single-error-correcting extended perfect binary systematic code of length
S2
S
by polynomial manipulations. |
---|---|
ISSN: | 0898-1221 1873-7668 |
DOI: | 10.1016/S0898-1221(97)00060-6 |