Binary decoding / Binary · full GV distance

The use of information sets in decoding cyclic codes

Eugene Prange

IRE Trans. Information Theory 1962

PublishedSource checked

Time bound: 2^{0.1207 n + o(n)}
Space bound: poly(n)

Source / version date: 1962
Comparison variant: Binary · full GV distance
Cost scale: 2^{c n + o(n)}

Assumptions and source notes

Historical full-GV specialization.

Source location

Introduction, classical comparison table
Version: 2017-04-22

Primary source ↗

BibTeXDownload .bib

@misc{prange1962,
  author = {Eugene Prange},
  title = {{The use of information sets in decoding cyclic codes}},
  year = {1962},
  url = {https://doi.org/10.1109/TIT.1962.1057777},
  cr_date = {1962-12-31},
  cr_date_precision = {year},
  cr_status = {published},
  cr_venue = {IRE Transactions on Information Theory},
  cr_author_ids = {eugene-prange}
}