Generating linear spans over finite fields

DOI10.4064/AA-61-2-183-181MaRDI QIDQ3351477zbMATH OpenOpenAlexFDO

Authors Wun-Seng Chou, Gary L. Mullen

Publication date 1992

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/206460

zbMATH Keywords

linear recurring sequenceminimal Hamming weightn-dimensional generating patternsprimitive polynomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Recommendations

• scientific article; zbMATH DE number 4127347
• Low-correlation, large linear span sequences from function fields
• scientific article; zbMATH DE number 4039793
• Extension of the Berlekamp-Massey algorithm to N dimensions
• Decimations of linear recurring sequences

Cited in

(5)

• The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
• The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence
• scientific article; zbMATH DE number 4127347 (Why is no real title available?)
• The number of different \(r\)-patterns in linear recurrent sequences over Galois rings
• Occurrence indices of elements in linear recurrence sequences over primary residue rings

This page was built for publication: Generating linear spans over finite fields

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