On circulant codes with prescribed distances

Publisher： Cambridge University Press

E-ISSN： 1755-1633|16|3|361-369

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.16, Iss.3, 1977-06, pp. : 361-369

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

Pairs of codes with prescribed Hamming distances and coincidences

By Grolmusz Vince  

Designs, Codes and Cryptography, Vol. 41, Iss. 1, 2006-10 ,pp. : 87-99

Springer Publishing Company

Access to resources Recommend Favorite

Classification of Extremal Double Circulant Self-Dual Codes of Lengths 64 to 72

By Gulliver T.   Harada Masaaki  

Designs, Codes and Cryptography, Vol. 13, Iss. 3, 1998-03 ,pp. : 257-269

Springer Publishing Company

Access to resources Recommend Favorite

An Algorithm for Computing the Minimum Distances of Extensions of BCH Codes Embedded in Semigroup Rings

By Cazaran J.   Kelarev A.V.   Quinn S.J.   Vertigan D.  

Semigroup Forum, Vol. 73, Iss. 3, 2006-12 ,pp. : 317-329

Springer Publishing Company

Access to resources Recommend Favorite

Typical circulant double coverings of a circulant graph

By Feng R.   Kwak J.H.  

Discrete Mathematics, Vol. 277, Iss. 1, 2004-02 ,pp. : 73-85

Elsevier

Access to resources Recommend Favorite

Circulant Double Coverings of a Circulant Graph of Valency Five

By Feng Rong   Kwak Jin  

Acta Mathematica Sinica, Vol. 23, Iss. 1, 2007-01 ,pp. : 23-28

Springer Publishing Company

Access to resources Recommend Favorite