Results 251 to 260 of about 143,950 (277)

Coded modulation with convolutional codes over rings

1991
The objective of this work is to present a multilevel convolutional coding method based on rings of integers modulo-m (generally m is a power of 2) which is suitable for Coded Modulation schemes. This new method of coded modulation is proposed because of the similarities between an m-ary phase shift keying modulation and the structure of a ring of ...
Renato Baldini Filho, Patrick G. Farrell
openaire   +1 more source

Trellis coded CPFSK over rings

Proceedings IEEE International Conference on Communications ICC '95, 2002
The paper presents ring trellis coded CPFSK in which the encoder has the same algebraic structure as the memory part of the CPM modulator. For M-ary CPFSK with a modulation index h=1/M, the authors show that this approach leads to a natural combination of the convolutional encoder with the memory part of the modulator.
G. Karam, K. Gosse, K. Maalej
openaire   +1 more source

$$\sigma $$-LCD codes over finite chain rings

Designs, Codes and Cryptography, 2019
In this paper, the authors studied the $\sigma$-LCD codes over finite chain rings. They characterize $\sigma$-LCD linear codes over finite chain rings by using their generator matrix. A necessary and sufficient condition for a linear code to be $\sigma$-LCD over a series of finite chain rings is given.
Liu, Xiusheng, Liu, Hualu
openaire   +2 more sources

Cyclic Codes over Galois Rings

2016
Let R be a Galois ring of characteristic $$p^a$$, where p is a prime and a is a natural number. In this paper cyclic codes of arbitrary length n over R have been studied. The generators for such codes in terms of minimal degree polynomials of certain subsets of codes have been obtained.
Jasbir Kaur, Sucheta Dutt, Ranjeet Sehmi
openaire   +1 more source

LCD codes over Galois rings

Computational and Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F. Rebaine, K. Guenda, T. A. Gulliver
openaire   +1 more source

Decoding LDPC Codes Over Integer Residue Rings

IEEE Transactions on Information Theory, 2006
Summary: This correspondence presents a multistage decoding approach for a free \(\mathbb Z_q\)-submodule of \(\mathbb Z_q^N\) of rank \(K\) defined by a sparse \((N-K)\times N\) parity-check matrix over \(\mathbb Z_q\) where \(q=p^m\), \(p=2\) and \(m>1\).
Armand, M.A., Ng, K.S.
openaire   +1 more source

Cyclic Codes over Finite Rings

2011 7th International Conference on Wireless Communications, Networking and Mobile Computing, 2011
A new Gray map between codes over finite rings $R=F_2+uF_2+u^2F_2$ and codes over $F_2$ is defined. We prove that the Gray image of a linear $(1+u+u^2)$-cyclic code over $R$ of length $n$ is a binary distance invariant linear cyclic code. We also prove that, if $n$ is odd, then every binary code which is the Gray image of a linear cyclic code over $R ...
openaire   +1 more source

Linear complementary pairs of codes over rings

Designs, Codes, and Cryptography, 2021
Peng Hu
exaly  

DNA codes over two noncommutative rings of order four

Journal of Applied Mathematics and Computing, 2021
Jon-Lark Kim
exaly  

Weight distribution of double cyclic codes over Galois rings

Designs, Codes, and Cryptography, 2021
Jian Gao, Fang-Wei Fu
exaly