Results 241 to 250 of about 29,686,764 (312)
Some of the next articles are maybe not open access.
On a Redundancy of AIFV-m Codes for m =3,5
2020 IEEE International Symposium on Information Theory (ISIT), 2020Hu, Yamamoto, Honda proposed the binary AIFVm codes and proved that the worst-case redundancy of optimal binary AIFV-m codes is exactly 1/m for m ∈{2,3,4}. We derive a new upper bound on the redundancy of optimal binary AIFV-3 codes when the probability of the most likely source symbol is known.
Ryusei Fujita +2 more
openaire +1 more source
Information Sciences, 1978
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhu Dev Sharma, Ravinder Kumar Khanna
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhu Dev Sharma, Ravinder Kumar Khanna
openaire +1 more source
An iterative algorithm to construct optimal binary AIFV-m codes
Information Theory Workshop, 2017We propose an algorithm to construct an optimal code that achieves the minimum average codeword length in the class of binary AIFV-m codes with m code trees T0, T1,…, Tm−1 for a given stationary memoryless source.
Hirosuke Yamamoto, K. Iwata
semanticscholar +1 more source
An Optimality Proof of the Iterative Algorithm for AIFV-m Codes
International Symposium on Information Theory, 2018Iwata and Yamamoto proposed an iterative algorithm to obtain the optimal AIFV-m code with $m$ code trees for a given source probability distribution, which can attain better compression rate than Huffman codes generally.
Ryusei Fujita +2 more
semanticscholar +1 more source
Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes
IEEE Transactions on Information Theory, 2021An $(m,n,a,b)$ -tensor code consists of $m\times n$ matrices whose columns satisfy ‘ $a$ ’ parity checks and rows satisfy ‘ $b$ ’ parity checks (i.e., a tensor code is the tensor product of a column code and row code).
Joshua Brakensiek +2 more
semanticscholar +1 more source
IEEE Transactions on Information Theory, 1992
Summary: The \(m\)-adic residue codes are a generalization of the quadratic residue codes. They are cyclic codes which exist at prime lengths \(p\) over \(GF(q)\) when \(m\mid (p-1),(q,p)=1\), and \(q\) is an \(m\)-adic residue modulo \(p\). The \(m\)-adic residue codes are investigated and are found to have many of the strong properties of the ...
openaire +2 more sources
Summary: The \(m\)-adic residue codes are a generalization of the quadratic residue codes. They are cyclic codes which exist at prime lengths \(p\) over \(GF(q)\) when \(m\mid (p-1),(q,p)=1\), and \(q\) is an \(m\)-adic residue modulo \(p\). The \(m\)-adic residue codes are investigated and are found to have many of the strong properties of the ...
openaire +2 more sources
On efficient m-ary balanced codes
Proceedings of IEEE International Symposium on Information Theory, 2002An m-ary balanced code is a code of length n over the alphabet Z/sub m/={0,1,..., m-1} such that each codeword is balanced; that is, the real sum of its components (or weight) is equal to [(m-1)n/2]. This paper contains new efficient methods to design m-ary balanced codes which improve the constructions found in the literature, for all alphabet size m ...
L. TALLINI, VACCARO, Ugo
openaire +3 more sources
A coding scheme for m-out-of-n codes
IEEE Transactions on Communications, 1990A scheme for the construction of m-out-of-n codes based on the arithmetic coding technique is described. For appropriate values of n, k, and m, the scheme can be used to construct an (n,k) block code in which all the codewords are of weight m. Such codes are useful, for example, in providing perfect error detection capability in asymmetric channels ...
openaire +1 more source
Block-coded M-PSK modulation over GF(M)
IEEE Transactions on Information Theory, 1993Channel codes where the redundancy is obtained not from parity symbols, but from expanding the channel signal-set, are addressed. They were initially proposed by G. Ungerboeck (1982) using a convolutional code. Here, a block coding approach is given. Rate m/(m+1) coded 2/sup m+1/-ary phase-shift keying (PSK) is considered.
Magnus Isaksson, Lars-Henning Zetterberg
openaire +1 more source
(M – 1) and (M – 2) selfsynchronising M-ary codes generated with coding efficiency
IEE Proceedings - Communications, 1998The presented algorithm can generate two kinds of selfsynchronising M-ary variable length codes that are the (M – 1) codes and the (M – 2) codes, respectively. Each of the constructed codes derived by this algorithm has the selfsynchronising property so that the decoder can always reach resynchronisation within a certain number of codewords when an ...
openaire +1 more source