Results 11 to 20 of about 139,863 (253)
IEEE Access, 2023 Tactile Internet (TI) has very stringent networking requirements and the transport layer plays a crucial role in meeting these requirements. However, the transport layer has several inherent limitations (e.g., bufferbloat, incast issue, and head of line ...
Shahzad +3 more
doaj +1 more source
On the list-decodability of random linear codes [PDF]
Proceedings of the forty-second ACM symposium on Theory of computing, 2010 The list-decodability of random linear codes is shown to be as good as that of general random codes. Specifically, for every fixed finite field Fq, p ∈ (0,1 - 1/q) and ε >; 0, it is proved that with high probability a random linear code C in Fqn of rate (1-Hq(p)-ε) can be list decoded from a fraction p of errors with lists of size at most O(1/ε ...
Venkatesan Guruswami +2 more
openaire +4 more sources
On linear index coding for random graphs [PDF]
2012 IEEE International Symposium on Information Theory Proceedings, 2012 A sender wishes to broadcast an n character word x in F^n (for a field F) to n receivers R_1,...,R_n. Every receiver has some side information on x consisting of a subset of the characters of x. The side information of the receivers is represented by a graph G on n vertices in which {i,j} is an edge if R_i knows x_j.
Ishay Haviv, Michael Langberg
openaire +2 more sources
Fulcrum Rateless Multicast Distributed Coding Design
IEEE Access, 2023 Establishing reliable and efficient multicast services in heterogeneous networks under an erasure channel is one of the current priorities in coding theory, particularly in Network Coding (NC) over data networks.
Yair Rivera Julio +2 more
doaj +1 more source
Efficient Communications in V2V Networks with Two-Way Lanes Based on Random Linear Network Coding
Entropy, 2023 Vehicle-to-vehicle (V2V) communication has gained significant attention in the field of intelligent transportation systems. In this paper, we focus on communication scenarios involving vehicles moving in the same and opposite directions. Specifically, we
Yiqian Zhang, Tiantian Zhu, Congduan Li
doaj +1 more source
Random Shortening of Linear Codes and Applications
, 2023 Random linear codes (RLCs) are well known to have nice combinatorial properties and near-optimal parameters in many different settings. However, getting explicit constructions matching the parameters of RLCs is challenging, and RLCs are hard to decode efficiently.
Xue Chen +3 more
openaire +3 more sources
A Shannon-Theoretic Approach to the Storage–Retrieval Trade-Off in PIR Systems
Information, 2023 We consider the storage–retrieval rate trade-off in private information retrieval (PIR) systems using a Shannon-theoretic approach. Our focus is mostly on the canonical two-message two-database case, for which a coding scheme based on random codebook ...
Chao Tian, Hua Sun, Jun Chen
doaj +1 more source
Design and Analysis of Systematic Batched Network Codes
Entropy, 2023 Systematic codes are of important practical interest for communications. Network coding, however, seems to conflict with systematic codes: although the source node can transmit message packets, network coding at the intermediate network nodes may ...
Licheng Mao +3 more
doaj +1 more source
On the weight distribution of random binary linear codes [PDF]
Random Structures & Algorithms, 2019 We investigate the weight distribution of random binary linear codes. For 0 < λ < 1 and n→∞ pick uniformly at random λn vectors in and let be the orthogonal complement of their span. Given 0 < γ < 1/2 with 0 < λ < h(γ) let X be the random variable that counts the number of words in C of Hamming weight γn.
Nati Linial, Jonathan Mosheiff
openaire +3 more sources
Distribution of the Minimum Distance of Random Linear Codes
2020 IEEE International Symposium on Information Theory (ISIT), 2020 In this paper, we study the distribution of the minimal distance (in the Hamming metric) of a random linear code of dimension $k$ in $\mathbb{F}_q^n$. We provide quantitative estimates showing that the distribution function of the minimal distance is close ({\it{}superpolynomially} in $n$)to the cumulative distribution function of the minimum of $(q^k ...
Jing Hao +3 more
openaire +2 more sources