Results 261 to 270 of about 29,101,112 (306)

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

Euclidean and Hermitian LCD MDS codes

Des. Codes Cryptogr., 2017
Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual is trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection attacks.
C. Carlet, Sihem Mesnager, Chunming Tang, Yanfeng Qi   +3 more
semanticscholar   +1 more source

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

Cyclic codes and some new entanglement-assisted quantum MDS codes

Designs, Codes and Cryptography, 2020
Entanglement-assisted quantum error correcting codes (EAQECCs) play a significant role in protecting quantum information from decoherence and quantum noise.
Wan Jiang, Shixin Zhu, Xiaojing Chen
semanticscholar   +1 more source

XORing Elephants: Novel Erasure Codes for Big Data

Proceedings of the VLDB Endowment, 2013
Distributed storage systems for large clusters typically use replication to provide reliability. Recently, erasure codes have been used to reduce the large storage overhead of three-replicated systems.
M. Sathiamoorthy, Megasthenis Asteris, Dimitris Papailiopoulos, A. Dimakis, Ramkumar Vadali, Scott Chen, Dhruba Borthakur   +6 more
semanticscholar   +1 more source

Hamming and simplex codes for the sum-rank metric

Designs, Codes and Cryptography, 2019
Sum-rank Hamming codes are introduced in this work. They are essentially defined as the longest codes (thus of highest information rate) with minimum sum-rank distance at least 3 (thus one-error-correcting) for a fixed redundancy r, base-field size q and
Umberto Martínez-Peñas
semanticscholar   +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