메뉴 건너뛰기




Volumn 56, Issue 11, 2008, Pages 1816-1823

On the peak-to-mean envelope power ratio of phase-shifted binary codes

Author keywords

BCH codes; Convolutional codes; Covering radius; Orthogonal frequency division multiplexing (OFDM); Peak to mean envelope power ratio (PMEPR); Peakto average power ratio (PAPR); Reed Muller codes

Indexed keywords

BINARY CODES; BINARY PHASE SHIFT KEYING; CONTROL THEORY; CONVOLUTION; CONVOLUTIONAL CODES; FREQUENCY ALLOCATION; FREQUENCY DIVISION MULTIPLEXING; ITERATIVE DECODING; MULTIPLEXING; ORTHOGONAL FREQUENCY DIVISION MULTIPLEXING; PHASE SHIFT; QUADRATURE AMPLITUDE MODULATION; VIDEO STREAMING;

EID: 57449110926     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2008.060652     Document Type: Article
Times cited : (7)

References (29)
  • 1
    • 0015288079 scopus 로고
    • Weight distributions of the cosets of the (32,6) Reed-Muller code
    • Jan
    • E. R. Berlekamp and L. R. Welch, "Weight distributions of the cosets of the (32,6) Reed-Muller code," IEEE Trans. Inform. Theory, vol. 18, no. 1, pp. 203-207, Jan. 1972.
    • (1972) IEEE Trans. Inform. Theory , vol.18 , Issue.1 , pp. 203-207
    • Berlekamp, E.R.1    Welch, L.R.2
  • 2
    • 39049162325 scopus 로고
    • On the covering radius of convolutional codes
    • Proc. First French-Israeli Workshop, Berlin, Germany: Springer-Verlag
    • I. E. Bocharova and B. D. Kudryashov, "On the covering radius of convolutional codes," in Proc. First French-Israeli Workshop (Lecture Notes in Computer Science), vol. 781. Berlin, Germany: Springer-Verlag, 1993, pp. 56-62.
    • (1993) Lecture Notes in Computer Science , vol.781 , pp. 56-62
    • Bocharova, I.E.1    Kudryashov, B.D.2
  • 4
    • 0029304929 scopus 로고
    • Covering properties of convolutional codes and associated lattices
    • May
    • A. R. Calderbank, P. C. Fishburn, and A. Rabinovich, "Covering properties of convolutional codes and associated lattices," IEEE Trans. Inform. Theory, vol. 41, no. 3, pp. 732-746, May 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , Issue.3 , pp. 732-746
    • Calderbank, A.R.1    Fishburn, P.C.2    Rabinovich, A.3
  • 5
    • 0032124006 scopus 로고    scopus 로고
    • 2k-liner codes, IEEE Trans. Inform. Theory 44, no. 4, pp. 1543-1547, Jul. 1998.
    • 2k-liner codes," IEEE Trans. Inform. Theory vol. 44, no. 4, pp. 1543-1547, Jul. 1998.
  • 6
    • 33846065768 scopus 로고    scopus 로고
    • Improving the upper bounds on the covering radii of binary Reed-Muller codes
    • Jan
    • C. Carlet and S. Mesnager, "Improving the upper bounds on the covering radii of binary Reed-Muller codes," IEEE Trans. Inform. Theory, vol. 53, no. 1, pp. 162-173, Jan. 2007.
    • (2007) IEEE Trans. Inform. Theory , vol.53 , Issue.1 , pp. 162-173
    • Carlet, C.1    Mesnager, S.2
  • 8
    • 0039412893 scopus 로고    scopus 로고
    • The length of primitive BCH codes with minimal covering radius
    • Jan
    • S. D. Cohen, "The length of primitive BCH codes with minimal covering radius," Designs, Codes and Cryptography, vol. 10, no. 1, pp. 5-16, Jan. 1997.
    • (1997) Designs, Codes and Cryptography , vol.10 , Issue.1 , pp. 5-16
    • Cohen, S.D.1
  • 9
    • 0033357267 scopus 로고    scopus 로고
    • Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes
    • Nov
    • J. A. Davis and J. Jedwab, "Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes," IEEE Trans. Inform. Theory, vol. 45, no. 7, pp. 2397-2417, Nov. 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , Issue.7 , pp. 2397-2417
    • Davis, J.A.1    Jedwab, J.2
  • 11
    • 0038956521 scopus 로고
    • Two-error correcting Bose-Chaudhuri codes are quasi-perfect
    • D. Gorenstein, W. Peterson, and N. Zierler, "Two-error correcting Bose-Chaudhuri codes are quasi-perfect," Inform. and Control, vol. 3, pp. 291-294, 1960.
    • (1960) Inform. and Control , vol.3 , pp. 291-294
    • Gorenstein, D.1    Peterson, W.2    Zierler, N.3
  • 12
    • 0010074140 scopus 로고
    • m-1 have covering radius 5
    • Mar
    • m-1 have covering radius 5," IEEE Trans. Inform. Theory, vol. 24, no. 2, pp. 257-258, Mar. 1978.
    • (1978) IEEE Trans. Inform. Theory , vol.24 , Issue.2 , pp. 257-258
    • Helleseth, T.1
  • 14
    • 34250823606 scopus 로고
    • Some new upper bounds on the covering radius of binary linear codes
    • Jan
    • H. Janwa, "Some new upper bounds on the covering radius of binary linear codes," IEEE Trans. Inform. Theory, vol. 35, no. 1, pp. 110-122, Jan. 1989.
    • (1989) IEEE Trans. Inform. Theory , vol.35 , Issue.1 , pp. 110-122
    • Janwa, H.1
  • 15
    • 0029695784 scopus 로고    scopus 로고
    • Combined coding for error control and increased robustness to system nonlinearities in OFDM
    • Atlanta, GA, pp, Apr
    • A. E. Jones and T. A. Wilkinson, "Combined coding for error control and increased robustness to system nonlinearities in OFDM," Proc. of IEEE 46th Vehicular Technology Conf. (VTC), Atlanta, GA, pp. 904-908, Apr. 1996.
    • (1996) Proc. of IEEE 46th Vehicular Technology Conf. (VTC) , pp. 904-908
    • Jones, A.E.1    Wilkinson, T.A.2
  • 16
    • 0028768760 scopus 로고
    • Block coding scheme for reduction of peak to mean envelope power ratio of multicarrier transmission schemes
    • Dec
    • A. E. Jones, T. A. Wilkinson, and S. K. Barton, "Block coding scheme for reduction of peak to mean envelope power ratio of multicarrier transmission schemes," IEE Electron. Lett., vol. 30, no. 25, pp. 2098-2099, Dec. 1994.
    • (1994) IEE Electron. Lett , vol.30 , Issue.25 , pp. 2098-2099
    • Jones, A.E.1    Wilkinson, T.A.2    Barton, S.K.3
  • 18
    • 0021519440 scopus 로고
    • The complexity of computing the covering radius of a code
    • Nov
    • A. M. McLoughlin, "The complexity of computing the covering radius of a code," IEEE Trans. Inform. Theory, vol. 30, no. 6, pp. 800-804, Nov. 1984.
    • (1984) IEEE Trans. Inform. Theory , vol.30 , Issue.6 , pp. 800-804
    • McLoughlin, A.M.1
  • 19
    • 0019014386 scopus 로고
    • The covering radius of the (128,8) Reed-Muller code is 56
    • May
    • J. Mykkeltveit, "The covering radius of the (128,8) Reed-Muller code is 56," IEEE Trans. Inform. Theory, vol. 26, no. 3, pp. 359-362, May 1980.
    • (1980) IEEE Trans. Inform. Theory , vol.26 , Issue.3 , pp. 359-362
    • Mykkeltveit, J.1
  • 20
    • 84968513749 scopus 로고
    • 1 extremal problem for polynomials
    • Dec
    • 1 extremal problem for polynomials," Proc. Amer. Math. Soc., vol. 16, pp. 1287-1290, Dec. 1965.
    • (1965) Proc. Amer. Math. Soc , vol.16 , pp. 1287-1290
    • Newman, D.J.1
  • 21
    • 0033880785 scopus 로고    scopus 로고
    • Generalized Reed-Muller codes and power control in OFDM modulation
    • Jan
    • K. G. Paterson, "Generalized Reed-Muller codes and power control in OFDM modulation," IEEE Trans. Inform. Theory, vol. 46, no. 1, pp. 104-120, Jan. 2000.
    • (2000) IEEE Trans. Inform. Theory , vol.46 , Issue.1 , pp. 104-120
    • Paterson, K.G.1
  • 22
    • 0034270963 scopus 로고    scopus 로고
    • On the existence and construction of good codes with low peak-to-average power ratios
    • Sept
    • K. G. Paterson and V. Tarokh, "On the existence and construction of good codes with low peak-to-average power ratios," IEEE Trans. Inform. Theory, vol. 46, no. 6, pp. 1974-1987, Sept. 2000.
    • (2000) IEEE Trans. Inform. Theory , vol.46 , Issue.6 , pp. 1974-1987
    • Paterson, K.G.1    Tarokh, V.2
  • 23
    • 33746928297 scopus 로고    scopus 로고
    • On cosets of the generalized first-order Reed-Muller code with low PMEPR
    • July
    • K.-U. Schmidt, "On cosets of the generalized first-order Reed-Muller code with low PMEPR," IEEE Trans. Inform. Theory, vol. 52, no. 7, pp. 3220-3232, July 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.7 , pp. 3220-3232
    • Schmidt, K.-U.1
  • 24
    • 33847630355 scopus 로고    scopus 로고
    • Complementary sets, generalized Reed-Muller codes, and power control for OFDM
    • Feb
    • K.-U. Schmidt, "Complementary sets, generalized Reed-Muller codes, and power control for OFDM," IEEE Trans. Inform. Theory, vol. 53, no. 2, pp. 808-814, Feb. 2007.
    • (2007) IEEE Trans. Inform. Theory , vol.53 , Issue.2 , pp. 808-814
    • Schmidt, K.-U.1
  • 25
    • 85008060947 scopus 로고    scopus 로고
    • Existence of codes with constant PMEPR and related design
    • Oct
    • M. Sharif and B. Hassibi, "Existence of codes with constant PMEPR and related design," IEEE Trans. Signal Processing, vol. 52, no. 10, pp. 2836-2846, Oct. 2004.
    • (2004) IEEE Trans. Signal Processing , vol.52 , Issue.10 , pp. 2836-2846
    • Sharif, M.1    Hassibi, B.2
  • 26
    • 0033875266 scopus 로고    scopus 로고
    • On the computation and reduction of the peak-to-average power ratio in multicarrier communications
    • Jan
    • V. Tarokh and H. Jafarkhani, "On the computation and reduction of the peak-to-average power ratio in multicarrier communications," IEEE Trans. Commun., vol. 48, no. 1, pp. 37-44, Jan. 2000.
    • (2000) IEEE Trans. Commun , vol.48 , Issue.1 , pp. 37-44
    • Tarokh, V.1    Jafarkhani, H.2
  • 27
    • 0025519421 scopus 로고
    • An upper bound on the covering radius as a function of the dual distance
    • Nov
    • A. A. Tietäväinen, "An upper bound on the covering radius as a function of the dual distance," IEEE Trans. Inform. Theory, vol. 36, no. 6, pp. 1472-1474, Nov. 1990.
    • (1990) IEEE Trans. Inform. Theory , vol.36 , Issue.6 , pp. 1472-1474
    • Tietäväinen, A.A.1
  • 28
    • 57449112925 scopus 로고    scopus 로고
    • S. G. Vladuts and A. N. Skorobogatov, Covering radius for long BCH codes, Probl. Pered. Inf., 25, pp. 38-45, 1989, translated in Probl. Inf. Transm., 25, no. 1, pp. 28-34, 1989.
    • S. G. Vladuts and A. N. Skorobogatov, "Covering radius for long BCH codes," Probl. Pered. Inf., vol. 25, pp. 38-45, 1989, translated in Probl. Inf. Transm., vol. 25, no. 1, pp. 28-34, 1989.
  • 29
    • 0036978302 scopus 로고    scopus 로고
    • A baseband model for computing the PAPR in OFDM systems
    • Berlin, Germany, pp, Jan
    • G. Wunder and H. Boche, "A baseband model for computing the PAPR in OFDM systems," Proc. of 4th Int. Conf. Source and Channel Coding, Berlin, Germany, pp. 273-280, Jan. 2002.
    • (2002) Proc. of 4th Int. Conf. Source and Channel Coding , pp. 273-280
    • Wunder, G.1    Boche, H.2


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