Applications of finite fields to combinatorics and finite geometries

DOI10.1007/s10440-006-9051-4zbMath1124.05017OpenAlexW2013358658MaRDI QIDQ850790

Aiden A. Bruen

Publication date: 6 November 2006

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10440-006-9051-4

zbMATH Keywords

finite fieldsaffine spaceMDS codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)

Related Items (2)

On low weight codewords of generalized affine and projective Reed-Muller codes ⋮ A \(p\)-adic condition on the weight of a codeword of a linear code

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On extendable planes, M.D.S. codes and hyperovals in PG(2,q), \(q=2^ t\)
• Polynomial multiplicities over finite fields and intersection sets
• Covering finite fields with cosets of subspaces
• Blocking sets
• The blocking number of an affine space
• Unimbeddable nets of small deficiency
• Partial Spreads and Replaceable Nets

This page was built for publication: Applications of finite fields to combinatorics and finite geometries