A tight asymptotic bound on the size of constant-weight conflict-avoiding codes

ISSN： 0925-1022

Source： Designs, Codes and Cryptography, Vol.57, Iss.1, 2010-10, pp. : 1-14

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

The characterization of binary constant weight codes meeting the bound of Fu and Shen

By Fu Fang-Wei Xia Shu-Tao

Designs, Codes and Cryptography, Vol. 43, Iss. 1, 2007-04 ,pp. : 9-20

Springer Publishing Company

Access to resources Recommend Favorite

Permutational labelling of constant weight Gray codes

Bulletin of the Australian Mathematical Society, Vol. 65, Iss. 3, 2002-06 ,pp. : 399-406

Cambridge University Press

Access to resources Recommend Favorite

On the Weight Hierarchy of Product Codes

By Martínez-Pérez Conchita Willems Wolfgang

Designs, Codes and Cryptography, Vol. 33, Iss. 2, 2004-09 ,pp. : 95-108

Springer Publishing Company

Access to resources Recommend Favorite

A Construction of Optimal Constant Composition Codes

By Ding Cunsheng Yin Jianxing

Designs, Codes and Cryptography, Vol. 40, Iss. 2, 2006-08 ,pp. : 157-165

Springer Publishing Company

Access to resources Recommend Favorite

Codes with the Same Weight Distributions as the Goethals Codes and the Delsarte-Goethals Codes

By Helleseth Tor Kumar P. Vijay Shanbhag Abhijit

Designs, Codes and Cryptography, Vol. 9, Iss. 3, 1996-11 ,pp. : 257-266

Springer Publishing Company

Access to resources Recommend Favorite