A Class of Multiple-error-correcting Binary Codes for Non-independent ErrorsStanford University, 1959 - 104 Seiten |
Inhalt
DEFINITION OF THE ALLOWABLE ERROR TYPES AND LOCATIONS | 5 |
Table | 9 |
Linear Feedback Binary ShiftRegister Sequences | 14 |
5 weitere Abschnitte werden nicht angezeigt.
Häufige Begriffe und Wortgruppen
A-words A'-subwords A₁ a₂ allowable error appropriate B₁ binary binits wide check word sequence check words associated check-word array Cır closed-loop column common factors complete groups correct D Dj derived double-adjacent error encoding table equations error-pattern sub error-pattern subword error-type subword errors in binits excess-error check words feedback logic feedback shift register Hamming distance indicated information binits initial condition k-binit linear feedback linearly independent location subword lolo lolol maximal sequence maximum number minimum modulo-2 nonmaximal sequences null vector number of binits number of information number of parity ollo olol oolool open-loop code P₁ P₂ parity binit locations Parity Check Table pattern subword perfect code prevents equality procedure proposed codes r-wide received word scalar multipliers shift register sequences single-error check words subword register superposition theorem Table 3a transmitted word zero ΘΑ ΘΡ Ꭰ Ꮎ Ꭰ Ꮎ Ꭰ Ꮎ Ꮎ Ꮎ Ꮿ Ꭰ