Abstract
The paper considers additive representation of the number of linear codes. The summands of the representation are numbers of linear codes of weight 1, 2, ... . Formulae for calculating the summands with respect to weight 1 and weight 2 are stated. The contribution of the summands mentioned to the whole sum is estimated. The property of strong logarithmic concavity of the number of linear codes of minimal weight is established.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kurts, D.C.: A Note on Concavity Properties of Triangular Arrays of Numbers. J. Comb. Theory, Vol. 13 (1972) 135–139
Lieb, E.H.: Concavity Properties and a Generating Function for Stirling Numbers. J. Comb. Theory, Vol. 5 (1968) 203–206
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-correcting Codes (1977)
Masol, V.I.: Asymptotic Behaviour of the Number of Certain k-dimantional Subspaces over a Finite Field. Mathematical Notes, Vol. 59 (1996) 525–530
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Masol, V. (2001). Investigation of Linear Codes Possessing Some Extra Properties. In: Honary, B. (eds) Cryptography and Coding. Cryptography and Coding 2001. Lecture Notes in Computer Science, vol 2260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45325-3_26
Download citation
DOI: https://doi.org/10.1007/3-540-45325-3_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43026-1
Online ISBN: 978-3-540-45325-3
eBook Packages: Springer Book Archive