Results 21 to 30 of about 42,243 (288)
A Novel Maximum Distance Separable Coded OFDM-RIS for 6G Wireless Communications
IEEE Wireless Communications Letters, 2023 The vision of the sixth generation mobile communication (6G) calls for extremely reliable data transmission over complex and diverse wireless channels. By combining the maximum distance separable (MDS) codes with the classic orthogonal frequency division
Yiqian Huang +4 more
semanticscholar +1 more source
Caching at the Edge with Fountain Codes [PDF]
, 2018 We address the use of linear randon fountain codes caching schemes in a heterogeneous satellite network. We consider a system composed of multiple hubs and a geostationary Earth orbit satellite.
Liva, Gianluigi +2 more
core +3 more sources
IEEE Access, 2020 Let p ≠ 3 be any prime. The structures of all λ-constacyclic codes of length 3ps over the finite commutative chain ring Fpm + uFpm (u2 = 0) are established in the term of their generator polynomials.
Hai Q. Dinh +2 more
doaj +1 more source
Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding
Information, 2019 The capacity of private information retrieval (PIR) from databases coded using maximum distance separable (MDS) codes was previously characterized by Banawan and Ulukus, where it was assumed that the messages are encoded and stored separably in the ...
Hua Sun, Chao Tian
doaj +1 more source
Systematic MDS erasure codes based on vandermonde matrices [PDF]
, 2004 An increasing number of applications in computer communications uses erasure codes to cope with packet losses. Systematic maximum-distance separable (MDS) codes are often the best adapted codes.
Fimes, Jérôme, Lacan, Jérôme
core +2 more sources
Some Connections Between Classical Coding and Network Coding Over Erroneous Cyclic Networks
IEEE Access, 2016 Recently, a framework was given for linear error-correcting network codes (LENCs) over cyclic networks on commutative rings. When the alphabet is considered as a rational power series ring, an LENC is referred to as a convolutional error-correcting ...
Vahid Samadi-Khaftari +2 more
doaj +1 more source
On Hamming Distance Distributions of Repeated-Root Cyclic Codes of Length 5ps Over Fp m + uFp m
IEEE Access, 2022 Let $p\not =5$ be any odd prime. Using the algebraic structures of all cyclic codes of length $5p^{s}$ over the finite commutative chain ring ${\mathcal{ R}}=\mathbb F_{p^{m}}+u\mathbb F_{p^{m}}$ , in this paper, the exact values of Hamming ...
Hai Q. Dinh +3 more
doaj +1 more source
Caching at the Edge with LT codes [PDF]
, 2018 We study the performance of caching schemes based on LT under peeling (iterative) decoding algorithm. We assume that users ask for downloading content to multiple cache-aided transmitters.
Liva, Gianluigi +2 more
core +2 more sources
On the Existence of XOR-Based Codes for Private Information Retrieval with Private Side Information
Entropy, 2021 We consider the problem of Private Information Retrieval with Private Side Information (PIR-PSI), wherein the privacy of the demand and the side information are jointly preserved. Although the capacity of the PIR-PSI setting is known, we observe that the
Murali Krishnan K. H., Jagadeesh Harshan
doaj +1 more source
On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6
IEEE Access, 2020 Let $p$ be an odd prime, $s$ , $m$ be positive integers such that $p^{m}\equiv 2 \pmod 3$ . In this paper, using the relationship about Hamming distances between simple-root cyclic codes and repeated-root cyclic codes, the Hamming distance of all ...
Hai Q. Dinh +2 more
doaj +1 more source