One-Point Codes Using Places of Higher Degree

DOI10.1109/TIT.2005.844058zbMath1309.94174MaRDI QIDQ3547353

Todd W. Michel, Gretchen L. Matthews

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (7)

Non-special subsets of the set of points of a curve defined over a finite field ⋮ On semigroups, Gröbner basis and algebras admitting a complete set of near weights ⋮ From the Carlitz exponential to Drinfeld modular forms ⋮ Floor type bound for the minimum distance of generalized algebraic geometric codes ⋮ Hermitian codes from higher degree places ⋮ AG codes from \(\mathbb{F}_{q^7}\)-rational points of the GK maximal curve ⋮ Lower bounds on the minimum distance in Hermitian one-point differential codes

This page was built for publication: One-Point Codes Using Places of Higher Degree