메뉴 건너뛰기




Volumn 9, Issue 6, 1999, Pages 547-558

Bounds on minimum distance for linear codes over GF(5)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); LINEAR SYSTEMS;

EID: 0033165510     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000050117     Document Type: Article
Times cited : (8)

References (13)
  • 2
    • 0027560909 scopus 로고
    • The linear programming bound for binary linear codes
    • Brouwer, A.E.: The Linear Programming Bound for Binary Linear Codes. IEEE Trans. Inf. Theory 39, 677-680 (1993)
    • (1993) IEEE Trans. Inf. Theory , vol.39 , pp. 677-680
    • Brouwer, A.E.1
  • 3
    • 0004308451 scopus 로고    scopus 로고
    • Eindhoven University of Technology, the Netherlands
    • Brouwer, A.E.: Linear Code Bound Server, Eindhoven University of Technology, the Netherlands, available electronically at URL: http://www.win.tue.nl/win/math/dw/ voorlincod.html.
    • Linear Code Bound Server
    • Brouwer, A.E.1
  • 5
    • 0031233344 scopus 로고    scopus 로고
    • New good quasi-cyclic ternary and quaternary linear codes
    • Daskalov, R.N., Gulliver, TA.: New Good Quasi-cyclic Ternary and Quaternary Linear Codes. IEEE Trans. Inf. Theory 43, 1647-1650 (1997)
    • (1997) IEEE Trans. Inf. Theory , vol.43 , pp. 1647-1650
    • Daskalov, R.N.1    Gulliver, T.A.2
  • 6
    • 0009450383 scopus 로고    scopus 로고
    • Near-MDS codes over some small fields
    • to appear
    • Dodunekov, S.M., Landjev, I.: Near-MDS Codes over Some Small Fields. Disc. Math. (to appear)
    • Disc. Math.
    • Dodunekov, S.M.1    Landjev, I.2
  • 8
    • 0000916411 scopus 로고
    • Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
    • Gulliver, TA., Bhargava, V.K.: Some Best Rate 1/p and Rate (p-1)/p Systematic Quasi-cyclic Codes over GF(3) and GF(4). IEEE Trans. Inf. Theory 38, 1369-1374 (1992)
    • (1992) IEEE Trans. Inf. Theory , vol.38 , pp. 1369-1374
    • Gulliver, T.A.1    Bhargava, V.K.2
  • 9
    • 84955580989 scopus 로고    scopus 로고
    • Some best rate 1/p quasi-cyclic codes over GF(5)
    • Fortier, P., Chouinard, J.-Y., Gulliver, T.A. (eds.). New York: Springer
    • Gulliver, T.A., Bhargava, V.K.: Some Best Rate 1/p Quasi-cyclic Codes over GF(5). In: Fortier, P., Chouinard, J.-Y., Gulliver, T.A. (eds.) Information Theory and Applications 2. Lecture Notes in Computer Science, pp 28-40 Vol. 1133. New York: Springer, 1996
    • (1996) Information Theory and Applications 2. Lecture Notes in Computer Science , vol.1133 , pp. 28-40
    • Gulliver, T.A.1    Bhargava, V.K.2
  • 11
    • 0009448213 scopus 로고
    • Optimal linear codes
    • Mitchel, C., (ed.) Oxford: Oxford Univ. Press
    • Hill, R.: Optimal Linear Codes. In: Mitchel, C., (ed.) Cryptography and Coding II. pp 75-104 Oxford: Oxford Univ. Press, 1992
    • (1992) Cryptography and Coding II , pp. 75-104
    • Hill, R.1


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