메뉴 건너뛰기




Volumn 38, Issue 2, 1992, Pages 227-246

Some Ternary and Quaternary Codes and Associated Sphere Packings

Author keywords

code constructions; coded modulation; codes; Constacyclic codes; coset; sphere packing

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

EID: 0026836634     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.119683     Document Type: Article
Times cited : (64)

References (25)
  • 3
    • 0023313295 scopus 로고
    • New trellis codes based on lattices and cosets
    • Jan.
    • A. R. Calderbank and N. J. A. Sloane, “New trellis codes based on lattices and cosets,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 177–195, Jan. 1987.
    • (1987) IEEE Trans. Inform. Theory , vol.IT-33 , pp. 177-195
    • Calderbank, A.R.1    Sloane, N.J.A.2
  • 4
    • 84945713988 scopus 로고
    • Coset codes I: Introduction and geometrical classification
    • Sept.
    • G. D. Forney, Jr., “Coset codes I: Introduction and geometrical classification,” IEEE Trans. Inform. Theory, vol. 34, pp. 1123–1151, Sept. 1988.
    • (1988) IEEE Trans. Inform. Theory , vol.34 , pp. 1123-1151
    • Forney, G.D.1
  • 5
    • 84941860379 scopus 로고
    • Coset codes II: Binary lattices and related codes
    • Sept.
    • “Coset codes II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1152–1187, Sept. 1988.
    • (1988) IEEE Trans. Inform. Theory , vol.34 , pp. 1152-1187
    • Forney, G.D.1
  • 6
    • 11144343315 scopus 로고
    • A new multilevel coding method using error-correcting codes
    • Mar.
    • H. Imai and S. Hirakawa, “A new multilevel coding method using error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 371–377, Mar. 1977.
    • (1977) IEEE Trans. Inform. Theory , vol.IT-23 , pp. 371-377
    • Imai, H.1    Hirakawa, S.2
  • 7
    • 0021306931 scopus 로고
    • Multidimensional signals for a continuous channel
    • Translated from Prob. Peredach. Inform
    • V. V. Ginzburg, “Multidimensional signals for a continuous channel,” Prob. Inform. Trans., vol. 20, no. 1, pp. 20–34, 1984. (Translated from Prob. Peredach. Inform., vol. 20, no. 1, pp. 28–46, 1984.)
    • (1984) Prob. Inform. Trans. , vol.20 , Issue.1 , pp. 20-34
    • Ginzburg, V.V.1
  • 8
    • 0022795919 scopus 로고
    • A class of optimum block codes in signal space
    • Oct.
    • S. I. Sayegh, “A class of optimum block codes in signal space,” IEEE Trans. Commun., vol. COM-34, pp. 1043–1045, Oct. 1986.
    • (1986) IEEE Trans. Commun. , vol.COM-34 , pp. 1043-1045
    • Sayegh, S.I.1
  • 9
    • 0004216907 scopus 로고
    • Algebraic Coding Theory
    • New York: McGraw-Hill
    • E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
    • (1968)
    • Berlekamp, E.R.1
  • 10
    • 0023415923 scopus 로고
    • An updated table of minimum-distance bounds for binary linear codes
    • Sept.
    • T. Verhoeff, “An updated table of minimum-distance bounds for binary linear codes,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 665–680, Sept. 1987.
    • (1987) IEEE Trans. Inform. Theory , vol.IT-33 , pp. 665-680
    • Verhoeff, T.1
  • 11
    • 0003525990 scopus 로고
    • The Theory of Error-Correcting Codes.
    • Amsterdam; North-Holland
    • F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam; North-Holland, 1977.
    • (1977)
    • MacWilliams, F.J.1    Sloane, N.J.A.2
  • 12
    • 0014782018 scopus 로고
    • Computer results on the minimum distance of some binary cyclic codes
    • May
    • C. L. Chen, “Computer results on the minimum distance of some binary cyclic codes,” IEEE Trans. Inform. Theory, vol. 16, pp. 359–360, May 1970.
    • (1970) IEEE Trans. Inform. Theory , vol.16 , pp. 359-360
    • Chen, C.L.1
  • 13
    • 0017996248 scopus 로고
    • The minimum distance of all binary cyclic codes of odd length from 69 to 99
    • July
    • G. Promhouse and S. E. Tavares, “The minimum distance of all binary cyclic codes of odd length from 69 to 99,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 438–442, July 1978.
    • (1978) IEEE Trans. Inform. Theory , vol.IT-24 , pp. 438-442
    • Promhouse, G.1    Tavares, S.E.2
  • 14
    • 0015559634 scopus 로고
    • Polynomial weights and code constructions
    • Jan.
    • J. L. Massey, D. J. Costello, Jr., and J. Justesen, “Polynomial weights and code constructions,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 101–110, Jan. 1973.
    • (1973) IEEE Trans. Inform. Theory , vol.IT-19 , pp. 101-110
    • Massey, J.L.1    Costello, D.J.2    Justesen, J.3
  • 15
    • 84888007175 scopus 로고
    • Private communication
    • July.
    • T. A. Gulliver, private communication, July 1989.
    • (1989)
    • Gulliver, T.A.1
  • 16
    • 0346558014 scopus 로고
    • On weights in quadratic-residue codes
    • E. F. Assmus, Jr. and H. F. Mattson, Jr., “On weights in quadratic-residue codes,” Discrete Math., vol. 3, pp. 1–20, 1972.
    • (1972) Discrete Math. , vol.3 , pp. 1-20
    • Assmus, E.F.1    Mattson, H.F.2
  • 17
    • 0007220586 scopus 로고
    • Construction of quasi-cyclic codes
    • Victoria, BC, Canada, May
    • T. A. Gulliver, “Construction of quasi-cyclic codes,” Ph.D. thesis, Univ. of Victoria, Victoria, BC, Canada, May 1989.
    • (1989) Ph.D. thesis, Univ. of Victoria
    • Gulliver, T.A.1
  • 18
    • 0024627773 scopus 로고
    • Multilevel codes and multistage decoding
    • Mar.
    • A. R. Calderbank, “Multilevel codes and multistage decoding,” IEEE Trans. Commun., vol. 37, pp. 222–229, Mar. 1989.
    • (1989) IEEE Trans. Commun. , vol.37 , pp. 222-229
    • Calderbank, A.R.1
  • 19
    • 34250844514 scopus 로고
    • Multilevel codes based on partitioning
    • Jan.
    • G. J. Pottie and D. P. Taylor, “Multilevel codes based on partitioning,” IEEE Trans. Inform. Theory, vol. 35, pp. 87–98, Jan. 1989.
    • (1989) IEEE Trans. Inform. Theory , vol.35 , pp. 87-98
    • Pottie, G.J.1    Taylor, D.P.2
  • 20
    • 0024703906 scopus 로고
    • A bounded-distance decoding algorithm for the Leech lattice, with generalizations
    • July
    • G. D. Forney, Jr., “A bounded-distance decoding algorithm for the Leech lattice, with generalizations,” IEEE Trans. Inform. Theory, vol. 35, pp. 906–909, July 1989.
    • (1989) IEEE Trans. Inform. Theory , vol.35 , pp. 906-909
    • Forney, G.D.1
  • 21
    • 0024718199 scopus 로고
    • Multidimensional constellations—Part I: Introduction, figures of merit, and generalized cross constellations
    • Aug.
    • G. D. Forney, Jr. and L.-F. Wei, “Multidimensional constellations—Part I: Introduction, figures of merit, and generalized cross constellations,” IEEE J. Selected Areas Commun., vol. 7, pp. 877–892, Aug. 1989.
    • (1989) IEEE J. Selected Areas Commun. , vol.7 , pp. 877-892
    • Forney, G.D.1    Wei, L.-F.2
  • 23
    • 0024880390 scopus 로고
    • Coset code constructions of N-dimensional sphere packings from one- and two-dimensional lattices
    • Victoria, BC, Canada, 1989
    • F. R. Kschischang and S. Pasupathy, “Coset code constructions of N-dimensional sphere packings from one- and two-dimensional lattices,” in Proc. IEEE Pacific Rim Conf. Commun., Comput., and Signal Processing, Victoria, BC, Canada, 1989, pp. 334–336.
    • (1989) Proc. IEEE Pacific Rim Conf. Commun., Comput., and Signal Processing , pp. 334-336
    • Kschischang, F.R.1    Pasupathy, S.2
  • 24
    • 0003851731 scopus 로고
    • Handbook of Mathematical Functions
    • New York: Dover Publications
    • M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions. New York: Dover Publications, 1965.
    • (1965)
    • Abramowitz, M.1    Stegun, I.A.2
  • 25
    • 0347818214 scopus 로고
    • Two quaternary quadratic residue codes
    • Jan.
    • J. M. Stein and V. K. Bhargava, “Two quaternary quadratic residue codes,” Proc. IEEE, vol. 63, p. 202, Jan. 1975.
    • (1975) Proc. IEEE , vol.63 , pp. 202
    • Stein, J.M.1    Bhargava, V.K.2


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