Code Design for Non-Coherent Detection of Frame Headers in Precoded Satellite Systems

06/07/2018
by   Farbod Kayhan, et al.
0

In this paper we propose a simple method for generating binary short-length rate-compatible families of codes that are robust to non-coherent detection for M-PSK constellations. We use a greedy algorithm to first construct a family of rotationally invariant codes with respect to M-PSK modulation. Then, by properly modifying such codes we obtain codes that are robust to non-coherent detection. For a special case of QPSK constellation, we use our algorithm to create binary codes with lengths up to N=256. Our method provides an upper bound for the length of optimal codes with a given desired non-coherent distance. We shortly discuss the optimality of our scheme and provide several simulations to evaluate the performance. Finally, we discuss the code construction problem for the frame header with a desired codeword error probability (CEP) and derive a simple upper bound on CEP of codes with a given non-coherent distance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/14/2018

Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes

It was shown in GXY18 that the length n of a q-ary linear locally recove...
research
03/29/2022

Enumeration of extended irreducible binary Goppa codes

The family of Goppa codes is one of the most interesting subclasses of l...
research
04/07/2018

On the ratio of prefix codes to all uniquely decodable codes with a given length distribution

We investigate the ratio ρ_n,L of prefix codes to all uniquely decodable...
research
11/05/2020

Coherent Flag Codes

In this paper we study flag codes on 𝔽_q^n, being 𝔽_q the finite field w...
research
04/18/2022

Linear codes using simplicial complexes

Certain simplicial complexes are used to construct a subset D of 𝔽_2^n^m...
research
11/11/2020

Unique Decoding of Explicit ε-balanced Codes Near the Gilbert-Varshamov Bound

The Gilbert-Varshamov bound (non-constructively) establishes the existen...
research
08/16/2021

Q-ary non-overlapping codes: a generating function approach

Non-overlapping codes are a set of codewords in ⋃_n ≥ 2ℤ_q^n, where ℤ_q ...

Please sign up or login with your details

Forgot password? Click here to reset