Some decoding applications of minimal realization

DOI10.1007/3-540-60693-9_8MaRDI QIDQ4608497zbMATH OpenOpenAlexFDO

Authors G. H. Norton

Publication date 21 March 2018

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60693-9_8

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• On the minimal realizations of a finite sequence
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• On multisequence shift register synthesis and generalized-minimum- distance decoding of Reed-Solomon codes
• On the minimal interpolation problem and decoding RS codes
• Shift-register synthesis and BCH decoding

Cites work

• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• Algebraic coding theory
• Decoding algebraic-geometric codes up to the designed minimum distance
• Goppa codes
• scientific article; zbMATH DE number 3586931 (Why is no real title available?)
• On \(n\)-dimensional sequences. I
• On the minimal realizations of a finite sequence
• Shift-register synthesis and BCH decoding
• The algebraic decoding of Goppa codes
• The stability theory of stream ciphers

Cited in

(2)

• On the minimal realizations of a finite sequence
• The BCH-Goppa decoding as a moment problem and a tau function over finite fields.

This page was built for publication: Some decoding applications of minimal realization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608497)