Shift-register synthesis and BCH decoding


It is shown in this paper that the iterative algorithm introduced by Berlekamp for decoding BCH codes actually provides a general solution to the problem of synthesizing the shortest linear feedback shift register capable of generating a prescribed finite sequence of digits. The shit-register approach leads to a simple proof of the validity of the algorithm… (More)
DOI: 10.1109/TIT.1969.1054260


2 Figures and Tables


Citations per Year

1,636 Citations

Semantic Scholar estimates that this publication has 1,636 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics