This paper discusses Varshamov-Gilbert bound, sphere-packing bound and some other problems of burst-error-correcting codes with weight constraints under a new metric. The new metric, introduced in an earlier paper, is defined in terms of suitable partition of the alphabet, the ring Zq, of ...
This paper describes a technique for high-speed decoding of burst-error-correcting codes and a class of codes most suitable for this purpose. With a small amount of additional circuitry the decoders proposed in this paper are capable of decoding speeds several orders of magnitude higher than thos...
The approach of this paper is to compare the properties of burst error correcting codes. It provides a simplified and direct application of the known information theory behind those codes which arr commonly found in the literature. For applications in which large coding is tolerable matrix codes ...
Summary: The performance of single burst-error-correcting (BEC) codes used over bursty channels is evaluated. The channel is represented by the Gilbert-Elliott model, which has been used by numerous authors to evaluate the performance of random-error-correcting codes over bursty channels. Recursive...
This invention relates to the field of error correction of transmitted data encoded by shortened cyclic block codes and more particularly relates to apparatus and a method of decoding cyclic block codes of data that have been subjected to burst errors having insertion, deletion, and inversion errors...
Burst error correcting codes, such as Fire codes, have traditionally been decoded using Linear Feedback Shift Registers (LFSR). However, such sequential decoding schemes are not suitable for modern ultra high-speed channels that demand high-speed parallel decoding employing only combinational logic circ...
In this paper, a class of majority decodable solid burst-error correcting cyclic codes will be presented. The advantage of the cyclic codes presented is that the complexity of the decoding algorithm is independent of the multiplicity of the solid burst-error patterns. For the correction of single...
The performance of single burst-error-correcting (BEC) codes used over bursty channels is evaluated. The channel is represented by the Gilbert-Elliott (196... Sharma,G.,Hassan,... - 《Communications IEEE Transactions on》 被引量: 29发表: 1998年 BER performance of OFDM-BPSK,-QPSK,- QAM ov...
This paper will present a class of minimum redundancy multiple burst-error-correcting cyclic codes. Although the rate of transmission is poor, it has a very easy decoding algorithm.HARRYDepartmentT.DepartmentHSUDepartmentInformaworldInternational Journal of Control...
The interesting problem of determining the possible sizes of perfect deletion-correcting codes has previously been studied. In this paper, we study the corresponding problem for burst deletion-correcting codes. We completely determine the spectrum of sizes for perfect burst deletion-correcting codes for...