Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleFast computations of Gr\"obner bases and blind recognitions of convolutional codes.
Author(s) PeiZhong Lu, Yan Zou
TypeBook, Chapter in Book, Conference Proceeding
AbstractThis paper provides a fast algorithm for Gröbner bases of homogenous ideals of the ring 𝔽[x,y] over a field 𝔽. The computational complexity of the algorithm is O(N 2), where N is the maximum degree of the input generating polynomials. The new algorithm can be used to solve a problem of blind recognition of convolutional codes. This is a new generalization of the important problem of synthesis of a linear recurring sequence
KeywordsGröbner basis, sequence synthesis, Berlekamp-Massey algorithm
ISBN978-3-540-73073-6/pbk
URL http://link.springer.com/chapter/10.1007%2F978-3-540-73074-3_24
LanguageEnglish
Pages303--317
PublisherBerlin: Springer
Year2007
Edition0
Translation No
Refereed No
Webmaster