The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain

DOI10.1007/BF01235722zbMath0837.94025MaRDI QIDQ1894579

Patrick Fitzpatrick, Graham H. Norton

Publication date: 2 August 1995

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

existenceminimal polynomialBerlekamp-Massey algorithmdecoding algorithmslinear recurring sequenceextended Euclidean algorithmpolynomial remainder sequenceeffective computationfactorial domainsone variable codes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15) Decoding (94B35)

Related Items (1)

Gröbner bases of characteristic ideals of LRS over UFD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Suites récurrentes linéaires. Propriétés algébriques et arithmétiques. (Linear recurrent sequences. Algebraic and arithmetic properties)
• Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence
• On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
• Subresultants and Reduced Polynomial Remainder Sequences
• Shift-register synthesis and BCH decoding
• Linear recurring sequences and the path weight enumerator of a convolutional code

This page was built for publication: The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain