A New Lower Bound on the Minimal Length of a Binary Linear Code

ISSN： 0195-6698

Source： European Journal of Combinatorics, Vol.17, Iss.4, 1996-05, pp. : 335-342

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Lower Bound for the Deree of the Minimal Polynomial of the Kronecker Product

By Cristina Caldeira

Linear and Multilinear Algebra, Vol. 51, Iss. 3, 2003-09 ,pp. : 243-262

Taylor & Francis Ltd

Access to resources Recommend Favorite

A new lower bound inequality for the norm of the symmetric product

By Pate Thomas

Linear and Multilinear Algebra, Vol. 57, Iss. 1, 2009-01 ,pp. : 87-102

Taylor & Francis Ltd

Access to resources Recommend Favorite

An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams

The Journal of Symbolic Logic, Vol. 73, Iss. 1, 2008-03 ,pp. : 227-237

Cambridge University Press

Access to resources Recommend Favorite

New constructions of optimal self-dual binary codes of length 54

By Bouyuklieva Stefka Östergård Patric

Designs, Codes and Cryptography, Vol. 41, Iss. 1, 2006-10 ,pp. : 101-109

Springer Publishing Company

Access to resources Recommend Favorite

A Lower Bound on Blocking Semiovals

By Dover J.M.

European Journal of Combinatorics, Vol. 21, Iss. 5, 2000-07 ,pp. : 571-577

Elsevier

Access to resources Recommend Favorite