Results 21 to 30 of about 7,804,605 (312)
Optimal minimal linear codes from posets [PDF]
Designs, Codes and Cryptography, 2020 Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun et al. We extend this construction method to arbitrary posets. Especially, anti-chains are corresponded to simplicial complexes.
J. Hyun, H. Kim, Yansheng Wu, Q. Yue
semanticscholar +1 more source
Optimal k-Deletion Correcting Codes [PDF]
International Symposium on Information Theory, 2019 Levenshtein introduced the problem of constructing k-deletion correcting codes in 1966, proved that the optimal redundancy of those codes is O(k log N), and proposed an optimal redundancy single-deletion correcting code (using the so-called VT ...
Jin Sima, Jehoshua Bruck
semanticscholar +1 more source
A Framework of Constructions of Minimal Storage Regenerating Codes with the Optimal Access/Update Property [PDF]
, 2015 In this paper, we present a generic framework for constructing systematic minimum storage regenerating codes with two parity nodes based on the invariant subspace technique.
Li, Jie, Parampalli, Udaya, Tang, Xiaohu
core +1 more source
Optimal prefix codes for pairs of geometrically-distributed random variables [PDF]
, 2013 Optimal prefix codes are studied for pairs of independent, integer-valued symbols emitted by a source with a geometric probability distribution of parameter $q$, $0{
Bassino, Frédérique +3 more
core +2 more sources
Optimal Few-Weight Codes From Simplicial Complexes [PDF]
IEEE Transactions on Information Theory, 2019 Recently, some infinite families of binary minimal and optimal linear codes were constructed from simplicial complexes by Hyun et al. Inspired by their work, we present two new constructions of codes over the ring $\mathbb {F}_{2}+u\mathbb {F}_{2}$ by ...
Yansheng Wu, Xiaomeng Zhu, Q. Yue
semanticscholar +1 more source
Polar codes are optimal for lossy source coding [PDF]
2009 IEEE Information Theory Workshop, 2009 We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar codes achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels under a successive decoding strategy.
Satish Babu Korada, Rüdiger L. Urbanke
openaire +3 more sources
Optimal $Z$ -Complementary Code Set From Generalized Reed-Muller Codes [PDF]
IEEE Transactions on Communications, 2019 $Z$ -complementary code set (ZCCS), an extension of perfect CCs, refers to a set of 2-D matrices having zero correlation zone properties. ZCCS can be used in various multi-channel systems to support, for example, quasi-synchronous interference-free ...
P. Sarkar, S. Majhi, Zilong Liu
semanticscholar +1 more source
Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes [PDF]
, 2009 An optimal constant-composition or constant-weight code of weight $w$ has linear size if and only if its distance $d$ is at least $2w-1$. When $d\geq 2w$, the determination of the exact size of such a constant-composition or constant-weight code is ...
Alan C. H. Ling +8 more
core +3 more sources
Optimal Locally Repairable Codes for Parallel Reading
IEEE Access, 2020 Locally repairable codes (LRCs) have important applications in distributed storage systems. In this paper, we study q-ary [n, k, d] LRCs with (r, t, δ)-information-locality, where each of the i-th (1 ≤ i ≤ k) information symbol is ...
Jie Hao +3 more
doaj +1 more source