메뉴 건너뛰기




Volumn 43, Issue 4, 1997, Pages 1238-1244

Linear programming bounds for doubly-even self-dual codes

Author keywords

Distance distribution; Self dual codes; Upper bounds

Indexed keywords

BOUNDARY CONDITIONS; LINEAR PROGRAMMING; POLYNOMIALS;

EID: 0031191632     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.605587     Document Type: Article
Times cited : (11)

References (15)
  • 2
    • 0025522511 scopus 로고
    • A new upper bound on the minimum distance of self-dual codes
    • Nov.
    • J. H. Conway and N. J. A. Sloane, "A new upper bound on the minimum distance of self-dual codes," IEEE Trans. Inform. Theory, vol. 36, pp. 1319-1333, Nov. 1990.
    • (1990) IEEE Trans. Inform. Theory , vol.36 , pp. 1319-1333
    • Conway, J.H.1    Sloane, N.J.A.2
  • 5
    • 0030120244 scopus 로고    scopus 로고
    • On integral zeros of Krawtchouk polynomials
    • _, "On integral zeros of Krawtchouk polynomials," J. Comb. Theory (Ser. A), vol. 74, no. 1, pp. 71-99, 1996.
    • (1996) J. Comb. Theory (Ser. A) , vol.74 , Issue.1 , pp. 71-99
  • 6
    • 35748986894 scopus 로고    scopus 로고
    • Bounds on spectra of codes with known dual distance
    • to be published
    • _, "Bounds on spectra of codes with known dual distance," Des., Codes Cryptogr., to be published.
    • Des., Codes Cryptogr.
  • 7
    • 0031142146 scopus 로고    scopus 로고
    • Estimates for the range of binomiality in codes' spectra
    • May
    • _, "Estimates for the range of binomiality in codes' spectra," IEEE Trans. Inform. Theory, vol. 43, pp. 987-991, May 1997.
    • (1997) IEEE Trans. Inform. Theory , vol.43 , pp. 987-991
  • 8
    • 0029378543 scopus 로고
    • Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
    • Sept.
    • V. I. Levenshtein, "Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces," IEEE Trans. Inform. Theory, vol. 41, pp. 1303-1321, Sept. 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 1303-1321
    • Levenshtein, V.I.1
  • 12
    • 0015602468 scopus 로고
    • An upper bound for self-dual codes
    • C. L. Mallows and N. J. A. Sloane, "An upper bound for self-dual codes," Inform. Contr., vol. 22, pp. 188-200, 1973.
    • (1973) Inform. Contr. , vol.22 , pp. 188-200
    • Mallows, C.L.1    Sloane, N.J.A.2
  • 13
    • 0002789907 scopus 로고
    • Upper bounds for modular forms, lattices, and codes
    • C. L. Mallows, A. M. Odlyzko, and N. J. A. Sloane, "Upper bounds for modular forms, lattices, and codes," J. Alg., vol. 36, pp. 68-76, 1975.
    • (1975) J. Alg. , vol.36 , pp. 68-76
    • Mallows, C.L.1    Odlyzko, A.M.2    Sloane, N.J.A.3
  • 15
    • 0026623869 scopus 로고
    • A bound for divisible codes
    • Jan.
    • H. N. Ward, "A bound for divisible codes," IEEE Trans. Inform. Theory, vol. 38, pp. 191-194, Jan. 1992.
    • (1992) IEEE Trans. Inform. Theory , vol.38 , pp. 191-194
    • Ward, H.N.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.