Maurice S. Lam

dblp:86/5468 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
finite fields
0.011993
Primitive polynomials and M-sequences over GF(qm) · IEEE Trans. Inf. Theory 1993
Coding theory › sequences › pseudorandom sequences
m-sequences
0.011993
Primitive polynomials and M-sequences over GF(qm) · IEEE Trans. Inf. Theory 1993
Coding theory › finite fields › finite field arithmetic
primitive polynomials
0.011993
Primitive polynomials and M-sequences over GF(qm) · IEEE Trans. Inf. Theory 1993
Coding theory
sequences
0.011993
Primitive polynomials and M-sequences over GF(qm) · IEEE Trans. Inf. Theory 1993

Methods — techniques the papers use, named apart from their topics

finite field arithmetic · 0.0
YearPublicationVenuePosition
1993 Primitive polynomials and M-sequences over GF(qm)
abstract
Procedures for obtaining primitive polynomials and m-sequences over GF(q/sup m/) in terms of primitive polynomials and m-sequences over GF(q) are presented. Using a degree mn primitive polynomial g(x) in GF(g, x), an m-sequence over GF(q/sup m/) can be expressed as a vector m-sequence whose component m-sequences are shifted versions of the m-sequence generated by g(x). The degree-n primitive polynomials in GF(q/sup m/,x) with root alpha q/sup i/, that are factors of g(x) with root alpha when g(x) is viewed in GF(q/sup m/,x), are then developed from the m-sequence over GF(q/sup m/). Expressions for the shifts and corresponding primitive polynomial for the m-sequence generated by the uth decimation of the m-sequence generated by the polynomials are also given. Expressions for the shifts and corresponding primitive polynomial factors of g(x) for different bases expressing GF(q/sup m/) over GF(q) are presented.>
John J. Komo, Maurice S. Lam
IEEE Trans. Inf. Theory2