An extremum problem for polynomials and bounds for codes with given distance and diameter

Publisher： Elsevier

ISSN： 0895-7177

Source： Mathematical and Computer Modelling, Vol.38, Iss.7, 2003-10, pp. : 789-795

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

Related content

Bounds on Spectra of Codes with Known Dual Distance

By Krasikov Ilia Litsyn Simon

Designs, Codes and Cryptography, Vol. 13, Iss. 3, 1998-03 ,pp. : 285-297

Springer Publishing Company

Access to resources Recommend Favorite

The New Minimum Distance Bounds of Goppa Codes and Their Decoding

By Park Chang-Seop Feng Gui-Liang Tzeng Kenneth K.

Designs, Codes and Cryptography, Vol. 9, Iss. 2, 1996-10 ,pp. : 157-176

Springer Publishing Company

Access to resources Recommend Favorite

Upper Bounds on the Covering Radius of a Code with a Given Dual Distance

By Litsyn S. Tietavainen A.

European Journal of Combinatorics, Vol. 17, Iss. 2, 1996-02 ,pp. : 265-270

Academic Press

Access to resources Recommend Favorite

New minimum distance bounds for linear codes over GF(5)

By Daskalov R. Hristov P. Metodieva E.

Discrete Mathematics, Vol. 275, Iss. 1, 2004-01 ,pp. : 97-110

Elsevier

Access to resources Recommend Favorite

97.33 An extremum problem

The Mathematical Gazette, Vol. 97, Iss. 539, 2013-07 ,pp. : 306-308

Cambridge University Press

Access to resources Recommend Favorite