Maximum-likelihood trellis decoding technique for balanced codes. [PDF]
, 1995 A low-complexity encoding and maximum-likelihood trellis decoding (MLTD) technique for nonlinear balanced codes is presented.
Markarian, G. S., Honary, B., Blaum, M.
core +4 more sources
Revisiting the calculation of effective free distance of turbo codes [PDF]
, 2008 The expression for the minimum Hamming weight of the output of a constituent convolutional encoder, when its input is a weight-2 sequence is revisited. The new expression particularly facilitates the calculation of the effective free distance of recently
Chatzigeorgiou, I., Wassell, I. J.
core +4 more sources
On the Concatenation of Non-Binary Random Linear Fountain Codes with Maximum Distance Separable Codes [PDF]
, 2011 The performance of a novel fountain coding scheme based on maximum distance separable (MDS) codes constructed over Galois fields of order q is investigated. Upper and lower bounds on the decoding failure probability under maximum likelihood decoding are
Lázaro Blasco, Francisco +3 more
core +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
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
Absolutely maximally entangled states, quantum maximum distance separable codes, and quantum repeaters [PDF]
, 2021 We extend the relation between absolutely maximally entangled (AME) states and quantum maximum distance separable (QMDS) codes by constructing whole families of QMDS codes from their parent AME states.
Razavi, M, Alsina, D
core +1 more source
Maximum distance separable codes [PDF]
, 2014 The focus of this bachelor thesis are maximum distance separable codes. A code is used to communicate over noise channel so any interferences that may occur can be detected and corrected.
Albanell Sarroca, Elisabeth
core +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
Repeated-Root Constacyclic Codes Over the Chain Ring Fpm[u]/⟨u3⟩
IEEE Access, 2020 Let Z = Fpm[u]/(u3) be the finite commutative chain ring, where p is a prime, m is a positive integer and Fpm is the finite field with pm elements. In this paper, we determine all repeated-root constacyclic codes of arbitrary lengths over Z and their ...
Tania Sidana, Anuradha Sharma
doaj +1 more source
Quantum MDS and Synchronizable Codes From Cyclic and Negacyclic Codes of Length 2
IEEE Access, 2020 Let p be an odd prime, and Fp(m) is the finite field of pm elements. In this paper, all maximum distance separable (briefly, MDS) cyclic and negacyclic codes of length 2ps over Fp(m) are established.
Hai Q. Dinh +2 more
doaj +1 more source