Department of Mathematical Foundations of Informatics
Issue Date:
2006
Publisher:
Institute of Mathematics and Informatics at the Bulgarian Academy of Sciences
Series/Report no.:
2006;2
Abstract:
In this work, we consider a classification of infinite families of linear codes which achieve the Griesmer bound, using the projective dual transform. We investigate the correspondence between families of linear codes with given properties via dual transform.
