共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1975,21(5):589-592
In this correspondence a method is presented whereby the average synchronization-error-correcting capability of Tavares' subset codes may be improved with no additional cost in rate and with only a small increase in the complexity of encoding and decoding. The method consists simply in shifting every word of the subset codes in such a way so that the shifted versions have a maximum number of leading and trailing zeros. A lower bound on the increase in synchronization-error-correcting capability provided by this method is derived. 相似文献
3.
4.
5.
6.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1977,23(4):518-520
If a linear binary code of lengthn contains the all-one codeword, than the weights of the code are symmetric. We consider those codes which do not contain the all-one codeword and yet have an equal number of symmetrically placed odd weight words. 相似文献
7.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1970,16(2):238-241
It is shown that certain coset codes derived from binary cyclic codes can determine the magnitude of a synchronization error, as well as its direction by examining only the syndrome of the receivedn tuple. For such coset codes, therefore, the need for a search procedure to recover synchronism is eliminated. In addition, the range of slip that can be detected and corrected for noisy channels is extended. 相似文献
8.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1970,16(5):643-644
9.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1986,32(1):106-108
LetC(B) denote the binary cyclicAN code with generatorA , whereAB=2^{n} - 1 . It is known thatC(B) is equidistant ifB is a prime powerp^{k} , where either2 or-2 is primitive moduloB providedpequiv 1 pmod{3}{rm if} k > 1 . It is conjectured that these are the onlyB such thatC(B) is equidistant. We have verified this forB < 100 000 . Several results are established that further limit the possibilities for counterexamples to the conjecture. 相似文献
10.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1982,28(5):789-790
The rank of the generating matrix in certain cases is computed. The result is perhaps of interest in its own right, apart from any applications it may have. The method of proof, utilizing as it does a knowledge of the parameters of a certain association scheme, is a technique which can be profitably used elsewhere. 相似文献
11.
12.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1986,32(6):849-854
The problem of achieving synchronization for variable-length source codes is addressed through the use of self-synchronizing binary prefix-condition codes. Although our codes are suboptimal in the sense of minimum average codeword length, they have the advantages of being generated by an explicit constructive algorithm, having minimal additional redundancy compared with optimal codes-as little as one additional bit introduced into the least likely codeword for a large class of sources-and having statistical synchronizing performance that improves on that of the optimal code in many cases. 相似文献
13.
14.
15.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1974,20(1):131-133
LetVprime be a binary(n,k) majority-logic decodable code withgprime (X) as its generator polynomial and odd minimum distanced . LetV be the(n, k - 1) subset code generated bygprime (X)(1 + X ). This correspondence shows thatV is majority-logic deeodable withd + 1 orthogonal estimates. This fact is useful in the simultaneous correction of random errors and erasures. 相似文献
16.
17.
18.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1987,33(6):919-923
LetC be the cyclic product code ofp single parity check codes of relatively prime lengthsn_{1}, n_{2},cdots , n_{p} (n_{1} < n_{2} < cdots < n_{p}) . It is proven thatC can correct2^{P-2}+2^{p-3}-1 bursts of lengthn_{1} , andlfloor(max{p+1, min{2^{p-s}+s-1,2^{p-s}+2^{p-s-1}}}-1)/2rfloor bursts of lengthn_{1}n_{2} cdots n_{s} (2leq s leq p-2) . Forp=3 this means thatC is double-burst-n_{1} -correcting. An efficient decoding algorithm is presented for this code. 相似文献
19.
20.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1975,21(5):581-582
In this correspondence, we construct a new class of binary codes by exploiting the symmetry properties of the parity check matrix of the Srivastava codes. The construction is a generalization of Goppa's construction [1]. A number of the binary codes constructed are proved equal, or superior, to the best codes previously known. 相似文献