Results 181 to 190 of about 1,807,959 (233)

On m-ary Gray codes

Information Sciences, 1978
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, 1993
Channel 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

m-adic residue codes

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

On efficient m-ary balanced codes

Proceedings of IEEE International Symposium on Information Theory, 2002
An 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

Coded M-PSK Modulation using Convolutional Self-Doubly Orthogonal Codes

VTC Spring 2009 - IEEE 69th Vehicular Technology Conference, 2009
In this paper, coded modulation technique based on the use of convolutional self-doubly orthogonal codes (CSO 2 C) and threshold iterative decoding is presented. Two different methods of coded modulation are considered. The first approach is based on a conventional pragmatic scheme.
Christian Cardinal, Bakitanga-Florian Mvutu   +1 more
openaire   +1 more source

(M – 1) and (M – 2) selfsynchronising M-ary codes generated with coding efficiency

IEE Proceedings - Communications, 1998
The 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

M-PSK Modulation using Mod-M Turbo Codes

2006 Proceedings of the First Mobile Computing and Wireless Communication International Conference, 2006
In most communication systems, power and bandwidth are limited. To achieve more reliability with consuming less power, turbo codes can be used as a powerful coding technique. On the other hand, to overcome the bandwidth constraint, a higher order modulation, such as M-PSK, may be needed.
Behrad Mahboobi, Mahdi Zamani, Said Nader-Esfahani   +2 more
openaire   +1 more source

Cyclic codes over R3,m

Discrete Mathematics, Algorithms and Applications, 2019
Let [Formula: see text] be the ring [Formula: see text]. We study cyclic codes of arbitrary length [Formula: see text] over the ring [Formula: see text] and obtain a complete characterization for them by presenting a unique set of generators for these codes.
openaire   +2 more sources

M-correlated dynamic Huffman code

Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation, 2002
The compression results of traditional variable length coding (VLC) are limited by the global entropy bound calculated from the statistics of entire source. Many entropy coder have been proposed for the purpose of approaching this compression bound as close as possible.
null Liang-Wei Lee, null Hsing-Hung Kuo, null Jhing-Fa-Wang   +2 more
openaire   +1 more source

Coded Spreading with m-sequences

2005 IEEE 61st Vehicular Technology Conference, 2005
Maximum length shift register (MLSR) sequences are utilized for joint channel coding and data spreading. Compared to uncoded spreading, more than 5 dB coding gain is obtained at BER of 10/sup -3/ in additive white Gaussian noise (AWGN) channels. The coding gain increases up to 22 dB in Rayleigh fading channels.
openaire   +1 more source