Applications of finite geometry in coding theory and cryptography

DOI10.3233/978-1-60750-663-8-38zbMath1366.94509OpenAlexW2296740665MaRDI QIDQ3195090

No author found.

Publication date: 21 October 2015

Full work available at URL: https://doi.org/10.3233/978-1-60750-663-8-38

zbMATH Keywords

finite geometryGriesmer boundMDS codessecret sharingAES

Mathematics Subject Classification ID

Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial structures in finite projective spaces (51E20)

Related Items (6)

Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\) ⋮ Geometry of smooth extremal surfaces ⋮ Bent vectorial functions and linear codes from o-polynomials ⋮ On the smallest size of an almost complete subset of a conic in \(\mathrm{PG}(2, q)\) and extendability of Reed-Solomon codes ⋮ New bounds for linear codes of covering radii 2 and 3 ⋮ New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces

This page was built for publication: Applications of finite geometry in coding theory and cryptography