Results 31 to 40 of about 624,831 (326)
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
Scalable Network Coding for Heterogeneous Devices over Embedded Fields
Entropy, 2022 In complex network environments, there always exist heterogeneous devices with different computational powers. In this work, we propose a novel scalable random linear network coding (RLNC) framework based on embedded fields, so as to endow heterogeneous ...
Hanqi Tang +4 more
doaj +1 more source
Index Coded Automatic Repeat Request (ARQ)
Entropy, 2020 In this paper, an index-coded Automatic Repeat Request (ARQ) is studied in the perspectives of transmission efficiency and memory overhead. Motivated by reducing significant computational complexity from huge matrix inverse computation of random linear ...
Sang Won Choi
doaj +1 more source
Linear sum codes for random access memories [PDF]
IEEE Transactions on Computers, 1988 Linear sum codes (LSCs) form a class of error control codes designed to provide on-chip error correction to semiconductor random access memories (RAMs). They use the natural addressing scheme found on RAMs to form and access codewords with a minimum of overhead.
Fuja, Tom, Heegard, Chris, Goodman, Rod
openaire +2 more sources
On Delay and Security in Network Coding [PDF]
, 2013 In this thesis, delay and security issues in network coding are considered. First, we study the delay incurred in the transmission of a fixed number of packets through acyclic networks comprised of erasure links. The two transmission schemes studied are
Dikaliotis, Theodoros K.
core +1 more source
An effective genetic algorithm for network coding [PDF]
, 2012 The network coding problem (NCP), which aims to minimize network coding resources such as nodes and links, is a relatively new application of genetic algorithms (GAs) and hence little work has so far been reported in this area.
Mark S. Leeson +5 more
core +1 more source
Improved List-Decodability of Random Linear Binary Codes [PDF]
IEEE Transactions on Information Theory, 2021 There has been a great deal of work establishing that random linear codes are as list-decodable as uniformly random codes, in the sense that a random linear binary code of rate $1 - H(p) - ε$ is $(p,O(1/ε))$-list-decodable with high probability. In this work, we show that such codes are $(p, H(p)/ε+ 2)$-list-decodable with high probability, for any $p \
Ray Li, Mary Wootters
openaire +4 more sources
Reliability of Broadcast Communications Under Sparse Random Linear Network Coding [PDF]
IEEE Transactions on Vehicular Technology, 2017 Ultrareliable point-to-multipoint communications are expected to become pivotal in networks offering future dependable services for smart cities. In this regard, sparse random linear network coding techniques have been widely employed to provide an ...
Suzie Brown, O. Johnson, Andrea Tassi
semanticscholar +1 more source
Applications of Coding in Network Communications [PDF]
, 2012 This thesis uses the tool of network coding to investigate fast peer-to-peer file distribution, anonymous communication, robust network construction under uncertainty, and prioritized transmission.
Chang, Christopher SungWook
core +1 more source
Throughput Analysis of Stop-and-Wait Automatic Repeat Request Scheme for Network Coding Nodes [PDF]
, 2010 This contribution analyzes the steady-state throughput of general network coding nodes, when data is transmitted based on stop-and-wait automatic repeat request (SW-ARQ) scheme.
Yang Qin +3 more
core +1 more source