A survey of array error control codes

European Transactions on Telecommunications

Volumn 3, Issue 5, 1992, Pages 441-454

  Farrell, Patrick Guy ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84985823803     PISSN: 1124318X     EISSN: 15418251     Source Type: Journal    
DOI: 10.1002/ett.4460030505     Document Type: Article

References (155)

1. On Gilbert burst‐error‐correcting codes
2. Single‐ and multiple‐burst‐correcting properties of a class of cyclic product codes
3. Error control techniques applicable to HF channels
4. Coding for the Gaussian Channel ‐ The promise of weighted output decoding
5. (v, κ, λ) Configurations and self‐dual codes
6. A family of efficient burst‐correcting array codes
7. A class of burst‐error‐correcting array codes
8. Multiple‐burst‐correcting array codes
9. Coding protection for magnetic tapes: a generalisation of the patel‐hong code
10. b‐adjacent error correction
11. Burst distance and multiple‐burst correction
12. Error correction for IBM 800‐bit‐inch magnetic tape
13. Cyclic product codes
14. A class of binary systematic codes correcting errors at random and in bursts (Hobbs codes)
15. Two‐dimensional parity checking
16. A combined coding and modulation approach for communication over dispersive channels
17. Byte‐oriented error‐correcting codes for semiconductor memory systems
18. Error‐correcting codes for semiconductor memory applications: A state of the art review
19. Iterated codes with improved performance
20. An extension of the codes introduced by Seguin, Allard and Bhargava
21. Extension of the smith construction for self‐orthogonal array codes
22. Channel coding for digital audio recordings
23. Cross‐interleave code for error correction of digital audio systems
24. A note on soft‐decision decoding with successive erasures
25. Error‐free coding
26. One‐step completely orthogonalis‐able UEP codes and their soft decision decoding
27. Code structure and decoding complexity
28. Burst‐error‐correcting array codes
29. Linear sum codes for random access memories
30. Theory of codes with maximum rank distance
31. Augmentation techniques for a class of product codes
32. Size limits on phased burst error correcting array codes
33. Error detecting and error correcting codes
34. Fuzzy correction capability
35. A high‐speed data transmission system
36. A general class of maximal codes for computer applications
37. A parallel memory with double error correction capability ‐ A class of one‐step majority‐logic decodable error correction codes
38. Orthogonal latin square codes
39. Two‐dimensional fire codes
40. A theory of two‐dimensional cyclic codes
41. Basic theory of two‐dimensional cyclic codes
42. Analysis of the characteristics of a new complex rotary code
43. New classes of binary codes constructed on the basis of concatenated codes and product codes
44. Performance of simple cross‐interleaved reed‐solomon decoding strategies for compact disc players
45. On error correction for PCM audio adaptor
46. Binary unequal error‐protection block codes formed from convolutional codes by generalised tail‐biting
47. Burst error correction capability of square array codes
48. Circuit techniques for a VSLI memory
49. On linear unequal error protection codes
50. The design og a high‐performance error‐correcting coding scheme for the Canadian broadcast telidon system based on reed‐solomon codes
51. A note on Gilbert burst‐correcting codes
52. Error‐correction techniques for random‐access memories
53. A method of examining orchard codes for minimum hamming distance five
54. Error recovery scheme for the IBM 3850 mars storage system
55. Adaptive cross‐parity (AXP) code for the IBM magnetic tape subsystem
56. Optimal rectangular code for high density magnetic tape
57. MDS convolutional codes
58. A double‐track error‐correction code for magnetic tape;
59. Polynomial codes over certain finite fields
60. Codes for the correction of clustered errors
61. A class of binary recurrent codes with limited error propagation
62. Maximum rank array codes and their application to crisscross error correction
63. Error‐detecting capabilities of two‐coordinate codes
64. Two‐dimensional cyclic codes ‐ an algorithm of determining the information bits and application to codes of even area
65. A class of high rate codes for byte‐oriented information systems
66. Improved read‐solomon decoding using multiple‐pass decoding
67. A new class of orchard codes with double bit error and single byte error correcting capability
68. Double byte error correcting codes constructed over GF(2)
69. Proposal of new coding pattern in orchard scheme
70. Some further theory of group codes
71. A simple description of an error correcting code for high‐density magnetic tape
72. Easily‐decoded efficient self‐orthogonal block codes
73. A recursive approach to low complexity codes
74. Self‐orthogonal quasi‐cyclic codes
75. Two‐dimensional dot codes for product identification
76. Multiple‐burst error‐correcting cyclic product codes
77. Burst decoding of binary block codes on q‐ary output channels
78. On codes derivable from the tensor product of check matrices
79. Analysis of recurrent codes
80. Selector‐line merged built‐in ECC technique for DRAMs
81. A submicron 1‐Mbit dynamic RAM with a 4 bit‐at‐a‐time built‐in ECC circuit
82. A class of binary burst error‐correcting quasi‐cyclic codes
83. Limiting efficiencies of burst‐correcting array codes