Asymptotically good binary linear codes with asymptotically good self-intersection spans

IEEE Transactions on Information Theory

Volumn 59, Issue 5, 2013, Pages 3038-3045

  Randriambololona, Hugues ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Asymptotic bounds; binary codes; intersection span; powers of codes

Indexed keywords

ALGEBRAIC-GEOMETRY CODES; ASYMPTOTIC BOUNDS; BINARY LINEAR CODES; EXTENSION FIELD; FIELD OPERATION; LINEAR CODES; POWERS OF CODES; SELF-INTERSECTIONS;

BINARY CODES; INFORMATION THEORY;

COMPUTER APPLICATIONS;

EID: 84876776516     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2013.2237944     Document Type: Article

References (13)

1. S. Ballet and J. Pieltant, "On the tensor rank of multiplication in any extension of," J. Complex., vol. 27, pp. 230-245, 2011.
2. I. Cascudo, H. Chen, R. Cramer, and C. Xing, "Asymptotically good ideal linear secret sharing with strong multiplication over any fixed finite field," in Proc. Advances in Cryptology-CRYPTO 2009, pp. 466-486, (Lecture Notes in Comp. Science, Vol. 5677), S. Halevi, Ed. Berlin: Springer-Verlag, 2009.
3. I. Cascudo, R. Cramer, and C. Xing, "The torsion-limit for algebraic function fields and its application to arithmetic secret sharing," in Proc. Advances in Cryptology-CRYPTO 2011, pp. 685-705, (Lecture Notes in Comp. Science, Vol. 6841), P. Rogaway, Ed. Berlin: Springer-Verlag, 2011.
4. I. Cascudo, R. Cramer, C. Xing, and A. Yang, "Asymptotic bound for multiplication complexity in the extensions of small finite fields," IEEE Trans. Inf. Theory, vol. 58, no. 7, pp. 4930-4935, Jul. 2012.
5. G. Cohen and A. Lempel, "Linear intersecting codes," Discr. Math., vol. 56, pp. 35-43, 1985.
6. V. Drinfeld and S. Vladut, "Number of points of an algebraic curve," Funct. Anal., vol. 17, pp. 53-54, 1983.
7. A. Garcia, H. Stichtenoth, A. Bassa, and P. Beelen, Towers of function fields over non-prime finite fields [Online]. Available: http://arxiv.org/abs/ 1202.5922 to be published
8. Y. Ihara, "Some remarks on the number of rational points of algebraic curves over finite fields," J. Fac. Sci. Univ. Tokyo Sect. IA Math., vol. 28, pp. 721-724, 1981.
9. A. Lempel and S. Winograd, "A new approach to error-correcting codes," IEEE Trans. Inf. Theory, vol. IT-23, no. 4, pp. 503-508, Jul. 1977.
10. D. Miklós, "Linear binary codes with intersection properties," Discr. Appl. Math., vol. 9, pp. 187-196, 1984. (Pubitemid 14667240)
11. H. Randriambololona, "Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method," J. Complex., vol. 28, pp. 489-517, 2012.
12. H. Randriambololona, "-separating systems beyond the probabilistic bound," Israel J.Math. [Online]. Available: http://arxiv.org/abs/1010.5764 to be published
13. C. Xing, "Asymptotic bounds on frameproof codes," IEEE Trans. Inf. Theory, vol. 48, no. 11, pp. 2991-2995, Nov. 2002. (Pubitemid 35327611)