Results 271 to 280 of about 7,804,605 (312)
Some of the next articles are maybe not open access.
On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
IEEE Transactions on Information Theory, 2020Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, a new combination of codes with locality and codes with multiple disjoint repair sets (also called availability) is introduced ...
Han Cai +3 more
semanticscholar +1 more source
Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
IEEE Transactions on Information Theory, 2020A linear code is optimal if it has the highest minimum distance of any linear code with a given length and dimension. We construct infinite families of optimal binary linear codes $C_{\Delta ^{c}}$ constructed from simplicial complexes in $\mathbb {F}^
J. Hyun, Jungyun Lee, Yoonjin Lee
semanticscholar +1 more source
Designing Near-Optimal Steganographic Codes in Practice Based on Polar Codes
IEEE Transactions on Communications, 2020Steganography is an information hiding technique for covert communication. So far Syndrome-Trellis Codes (STC), a convolutional codes-based method, is the only near-optimal coding method, i.e., it can approach the rate-distortion bound of content ...
Wei-xiang Li +4 more
semanticscholar +1 more source
International Journal of Computer Mathematics, 2004
Novel synchronous coding schemes are introduced and relationships between optimal synchronous codes and Huffman codes are discussed. Although the problem of existence of the optimal synchronous codes has not yet resolved, we show that any synchronous code can be considered as an optimal synchronous code for some information source alphabet.
Dongyang Long +2 more
openaire +1 more source
Novel synchronous coding schemes are introduced and relationships between optimal synchronous codes and Huffman codes are discussed. Although the problem of existence of the optimal synchronous codes has not yet resolved, we show that any synchronous code can be considered as an optimal synchronous code for some information source alphabet.
Dongyang Long +2 more
openaire +1 more source
Two Families of Optimal Linear Codes and Their Subfield Codes
IEEE Transactions on Information Theory, 2020In this paper, a family of $[{q}^{2}-1, 4, {q}^{2}-{q}-2]$ cyclic codes over ${\mathbb F}_{{q}}$ meeting the Griesmer bound is presented. Their duals are $[{q}^{2}-1,{q}^{2}-5,4]$ almost MDS codes and are optimal with respect to the sphere-packing ...
Ziling Heng, Qiuyan Wang, C. Ding
semanticscholar +1 more source
Communications of the ACM, 1969
Methods of analyzing the control flow and data flow of programs during compilation are applied to transforming the program to improve object time efficiency. Dominance relationships, indicating which statements are necessarily executed before others, are used to do global common expression elimination and loop identification.
Edward S. Lowry, C. W. Medlock
openaire +1 more source
Methods of analyzing the control flow and data flow of programs during compilation are applied to transforming the program to improve object time efficiency. Dominance relationships, indicating which statements are necessarily executed before others, are used to do global common expression elimination and loop identification.
Edward S. Lowry, C. W. Medlock
openaire +1 more source
IEEE Transactions on Information Theory, 2001
Summary: Permutation codes are vector quantizers whose codewords are related by permutations and, in one variant, sign changes. Asymptotically, as the vector dimension grows, optimal Variant I permutation code design is identical to optimal entropy-constrained scalar quantizer (ECSQ) design.
Vivek K. Goyal +2 more
openaire +1 more source
Summary: Permutation codes are vector quantizers whose codewords are related by permutations and, in one variant, sign changes. Asymptotically, as the vector dimension grows, optimal Variant I permutation code design is identical to optimal entropy-constrained scalar quantizer (ECSQ) design.
Vivek K. Goyal +2 more
openaire +1 more source
Proceedings DCC 2001. Data Compression Conference, 2002
We propose a new transform coding algorithm that integrates all optimization steps into a coherent and consistent framework. Each iteration of the algorithm is designed to minimize coding distortion as a function of both the transform and quantizer designs.
Cynthia Archer, Todd K. Leen
openaire +1 more source
We propose a new transform coding algorithm that integrates all optimization steps into a coherent and consistent framework. Each iteration of the algorithm is designed to minimize coding distortion as a function of both the transform and quantizer designs.
Cynthia Archer, Todd K. Leen
openaire +1 more source
Optimal Prefix Codes And Huffman Codes
International Journal of Computer Mathematics, 2003Existence of the optimal prefix codes is shown in this paper. Relationship between the optimal prefix code and the Huffman code is also discussed. We prove that all Huffman codes are optimal prefix codes and conversely optimal prefix codes need not be Huffman codes.
Dongyang Long +2 more
openaire +1 more source
2001
Novel coding schemes are introduced and relationships between optimal codes and Huffman codes are discussed. It is shown that, for finite source alphabets, the Huffman coding is the optimal coding, and conversely the optimal coding needs not to be the Huffman coding.
Dongyang Long, Weijia Jia 0001
openaire +1 more source
Novel coding schemes are introduced and relationships between optimal codes and Huffman codes are discussed. It is shown that, for finite source alphabets, the Huffman coding is the optimal coding, and conversely the optimal coding needs not to be the Huffman coding.
Dongyang Long, Weijia Jia 0001
openaire +1 more source