Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound

DOI10.1137/S0895480100376435zbMath1005.94027MaRDI QIDQ2784499

Tim Blackmore, Graham H. Norton

Publication date: 23 April 2002

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

DLP boundHermitian codealgebraic geometric codedecoding complexityabsolute state complexitydimension/length profile boundtrellis state complexity

Mathematics Subject Classification ID

Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combined modulation schemes (including trellis codes) in coding theory (94B12) Special algebraic curves and curves of low genus (14H45) Applications to coding theory and cryptography of arithmetic geometry (14G50)

This page was built for publication: Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound