Standard bases concordant with the norm and computations in ideals and polylinear recurring sequences

Gorbatov, E. V.

doi:10.1007/s10958-006-0384-3

J Math Sci

2006

DOI: 10.1007/s10958-006-0384-3

|View full text |Cite

Standard bases concordant with the norm and computations in ideals and polylinear recurring sequences

E. V. Gorbatov

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings

Kuijper

Pinto

2016

Des. Codes Cryptogr.

View full text Add to dashboard Cite

The construction of shortest feedback shift registers for a finite sequence S1, . . . , SN is considered over the finite ring Zpr . A novel algorithm is presented that yields a parametrization of all shortest feedback shift registers for the sequence of numbers S1, . . . , SN , thus solving an open problem in the literature. The algorithm iteratively processes each number, starting with S1, and constructs at each step a particular type of minimal Gröbner basis. The construction involves a simple update rule at each step which leads to computational efficiency. It is shown that the algorithm simultaneously computes a similar parametrization for the reciprocal sequence SN , . . . , S1. * M. Kuijper is with the

show abstract

An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings

Kuijper

Pinto

2016

Des. Codes Cryptogr.

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Standard bases concordant with the norm and computations in ideals and polylinear recurring sequences

Cited by 1 publication

References 16 publications

An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings

An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings

Contact Info

Product

Resources

About