Abstract
In [2,4] the notion of a recursive code was introduced and some constructions of recursive MDS codes were proposed. The main result was that for any q ∉ {2, 6} (except possibly ∈ {14, 18, 26, 42}) there exists a recursive MDS-code in an alphabet of q elements of length 4 and combinatorial dimension 2(i.e. a recursive {4, 2, 3}q-code). One of the constructions we used there was that of pseudogeometries; it enabled us to show that for any q > 126 (except possibly q = 164) there exists a recursive [4,2,3]q-code that contains all the “constants”. One part of the present note is the further application of the pseudogeometry construction which shows that for any q > 164 (resp. q > 26644) there exists a recursive [7,2,6]q-code (resp. [13,2,12]q-code) containing “constants”. Another result presented here is a negative one: we show that there is no nontrivial pseudogeometry consisting of 14, 18, 26 or 42 points with no lines of order 2, 3, 4 or 6, so the pseudogeometry construction cannot be applied for settling the question mentioned in the above. In both cases the usage of computer is essential.
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
R.K. Brayton, D. Coppersmith & J. Hoffman, “Self orthogonal Latin squares of all orders n ≠ 2, 3, 6”, Bull, Amer. Math. Soc., 80 (1974), 116–119.
Couselo E., Gonzalez S., Markov V., Nechaev A. “Recursive MDS-codes and recursively differentiable quasigroups”, Diskr. Math. and Appl., V.8, No. 3, 217–247, VSP, 1998.
Couselo E., Gonzalez S., Markov V., Nechaev A. “Recursive MDS-codes and recursively differentiable quasigroups-II”, Diskr. Math. and Appl., to appear.
Couselo E., Gonzalez S., Markov V., Nechaev A. “Recursive MDS-codes”. In: Workshop on coding and cryptography (WCC’99). January 11–14, 1999, Paris. Proceedings. 271–277.
J. Dénes & A.D. Keedwell, “Latin Squares and their Applications”. Akadémiai Kiadó, Budapest; Academic Press, New York; English Universities Press, London, 1974.
J. Dénes & A.D. Keedwell, “Latin squares. New developments in the theory and applications”. Annals of Discrete Mathematics, 46. North-Holland, Amsterdam, 1991.
Heise W. & Quattrocci P. “Informations-und codierungstheorie”, Springer, 1995, Berlin-Heidelberg.
MacWilliams F.J. & Sloane N.J.A. “The theory of Error-Correcting Codes”. Elsevier Science Publishers, B.V., 1988. North Holland Mathematical Library, Vol. 16.
Tsfasman M.A., Vlăduţ S.G., “Algebraic-geometric codes”, Kluwer Acad. Publ., Dordrecht-Boston-London, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Couselo, E., Gonzalez, S., Markov, V., Nechaev, A. (1999). Recursive MDS-Codes and Pseudogeometries. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_21
Download citation
DOI: https://doi.org/10.1007/3-540-46796-3_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66723-0
Online ISBN: 978-3-540-46796-0
eBook Packages: Springer Book Archive