Results 251 to 260 of about 29,101,112 (306)
Some of the next articles are maybe not open access.
Sparse distributed memory using N-of-M codes
Neural Networks, 2004An analysis is presented of a sparse distributed memory (SDM) inspired by that described by Kanerva [Kanerva, P. (1988). Sparse distributed memory. Cambridge, MA: MIT Press] but modified to facilitate an implementation based on spiking neurons. The memory presented here employs sparse binary N-of-M codes, unipolar binary synaptic weights and a simple ...
Furber, Steve B. +3 more
openaire +3 more sources
An Algorithm for Constructing the Optimal Code Trees for Binary Alphabetic AIFV-m Codes
Information Theory Workshop, 2021We call the alphabetic version of the AIFV-m code the alphabetic AIFV-m codes. This paper defines binary alphabetic AIFV-m codes and proposes an algorithm to design the optimal binary alphabetic AIFV-m codes in terms of the minimum average codeword ...
K. Iwata, Hirosuke Yamamoto
semanticscholar +1 more source
Hulls of Generalized Reed-Solomon Codes via Goppa Codes and Their Applications to Quantum Codes
IEEE Transactions on Information Theory, 2021A Goppa code over $\Bbb F_{q^{m}}$ is a well-known subclass of algebraic error-correcting code. If $m=1$ , then it is a generalized Reed-Solomon(GRS) code and its dual code is called a GRS code via a Goppa code.
Yanyan Gao +3 more
semanticscholar +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
Information Sciences, 1978
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sharma, Bhu Dev, Khanna, Ravinder Kumar
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sharma, Bhu Dev, Khanna, Ravinder Kumar
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.
Isaksson, Magnus, Zetterberg, Lars H.
openaire +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