SCOPUS 정보 검색 플랫폼

IEEE Transactions on Information Theory

Volumn 47, Issue 5, 2001, Pages 2069-2077

Optimal block codes for M-ary runlength-constrained channels

(2) Datta, S a McLaughlin, S W a

a GEORGIA INSTITUTE OF TECHNOLOGY (United States)

Author keywords

Enumerative coding; Nonbinary optical recording; Permutation codes; Runlength limited (RLL) codes; Template codes

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BINARY SEQUENCES; CHANNEL CAPACITY; CONSTRAINT THEORY; DECODING; EIGENVALUES AND EIGENFUNCTIONS; LAGRANGE MULTIPLIERS; LINEAR ALGEBRA; OPTICAL RECORDING; PROBABILITY DISTRIBUTIONS; RANDOM NUMBER GENERATION; TABLE LOOKUP; THEOREM PROVING;

PERMUTATION CODES; RUNLENGTH CONSTRAINT CHANNEL; RUNLENGTH-LIMITED (RLL) CODES;

BLOCK CODES;

EID: 0035397702 PISSN: 00189448 EISSN: None Source Type: Journal
DOI: 10.1109/18.930945 Document Type: Article

Times cited : (10)

References (21)

1
- 0001877764
- Optical data storage with electron trapping materials using M-ary data channel coding
- San Jose, CA
- (1992) Proc. SPIE 1663, Optical Data Storage , pp. 92-103
- Earman, A.¹

2
- 0004625740
- Increasing transfer rate and capacity in optical data storage through pit depth modulation
- Maui, HI, July
- (1996) Proc. OSA Optical Data Storage Conf.
- Johnson, B.¹

3
- 0343873313
- High-density over-writeable phase-change optical disk for PD systems
- San Diego, CA, July
- (1995) Proc. SPIE Optical Data Storage Conf. , vol.2514
- Ohta, T.¹ Yoshioka, K.² Isomura, H.³ Akiyama, T.⁴ Imanaka, R.⁵

4
- 0028725369
- M-ary runlength-limited codes for high density optical recording
- Trondheim, Norway, July
- (1994) Proc. 1994 Int. Symp. Information Theory
- McLaughlin, S.W.¹ Earman, A.² Gerpheide, J.³

5
- 0029274226
- Improved distance M-ary (d, k) codes for high density recording
- Mar.
- (1995) IEEE Trans. Magn. , vol.33 , pp. 1155-1160
- McLaughlin, S.W.¹

6
- 0031140434
- Five runlength-limited codes for M-ary recording channels
- May
- (1997) IEEE Trans. Magn. , vol.33 , pp. 2442-2450

7
- 0031103734
- The construction of M-ary (d, ∞) codes that achieve capacity and have the fewest number of encoder states
- Mar.
- (1997) IEEE Trans. Inform. Theory , vol.43 , pp. 699-703

8
- 0023420465
- Results involving (d, k)-constrained M-ary codes
- Sept.
- (1987) IEEE Trans. Magn. , vol.23 , pp. 3678-3680
- French, C.A.¹ Dixon, G.S.² Wolf, J.³

9
- 0014924901
- Block codes for a class of constrained noiseless channels
- (1970) Inform. Contr. , vol.17 , pp. 436-461
- Tang, D.T.¹ Bahl, L.R.²

10
- 84856043672
- A mathematical theory of communication
- July
- (1948) Bell Syst. Tech. J. , vol.27 , pp. 379-423
- Shannon, C.E.¹

11
- 0020542188
- Algorithms for sliding block codes. An application of symbolic dynamics to information theory
- Jan.
- (1983) IEEE Trans. Inform. Theory , vol.IT-29 , pp. 5-22
- Adler, R.L.¹ Coppersmith, D.² Hassner, M.³

12
- 0020824706
- A generalized method for encoding and decoding runlength-limited binary sequences
- Sept.
- (1983) IEEE Trans. Inform. Theory , vol.IT-29 , pp. 751-754
- Beenker, G.F.M.¹ Immink, K.A.S.²

13
- 0030241184
- Encoding of dklr-sequences using one weight set
- Sept.
- (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 1553-1554
- Patrovics, L.¹ Immink, K.A.S.²

14
- 0028428759
- A new approach to constructing optimal block codes for runlength-limited channels
- May
- (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 774-785
- Gu, J.¹ Fuja, T.²

15
- 0033184928
- An enumerative method for runlength-limited codes: Permutation codes
- Sept.
- (1999) IEEE Trans. Inform. Theory , vol.45 , pp. 2199-2204
- Datta, S.¹ McLaughlin, S.W.²

16
- 0023830310
- On runlength codes
- Jan.
- (1988) IEEE Trans. Inform. Theory , vol.34 , pp. 45-55
- Zehavi, E.¹ Wolf, J.K.²

17
- 84938848379
- Permutation codes, (d, k) codes and magnetic recording
- W. Tompkins, Ed., Sept.
- (1990) Proc. 1990 IEEE Colloquium in South America, Argentina, Brazil, Chile, Uruguay
- Wolf, J.K.¹

18
- 84892180578
- Permutation modulation
- Mar.
- (1965) Proc. IEEE , vol.53 , pp. 228-236
- Slepian, D.¹

19
- 0004631470
- Art of constructing low-complexity encoders/decoders for constrained block codes
- submitted for publication
- IEEE Trans. Inform. Theory
- Modha, D.S.¹ Marcus, B.H.²

20
- 0015565580
- Enumerative source coding
- Jan.
- (1973) IEEE Trans. Inform. Theory , vol.IT-19 , pp. 73-77
- Cover, T.M.¹

21
- 0003424546
- Ph.D. dissertation, Georgia Inst. Technol., Atlanta
- (2000) New results on coding for M-ary runlength-limited channels
- Datta, S.¹

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