Fast Computations of Gröbner Bases and Blind Recognitions of Convolutional Codes
From MaRDI portal
Publication:5426099
DOI10.1007/978-3-540-73074-3_24zbMath1196.13017MaRDI QIDQ5426099
Publication date: 15 November 2007
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73074-3_24
Gröbner basis; Berlekamp-Massey algorithm; sequence synthesis; blind recognition of convolutional code
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
94B10: Convolutional codes