Results 41 to 50 of about 106,176 (185)
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
, 2004 Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear codes is NP-hard.
Guruswami, Venkatesan, Vardy, Alexander
core +2 more sources
Jurnal Teknik ITS, 2013 Sistem komunikasi satelit saat ini sedang dikembangkan oleh mahasiswa-mahasiswi ITS, salah satunya yaitu Sistem komunikasi satelit nano 2,4 GHz untuk pengiriman citra.
Andi Nurul Utami Husain +2 more
doaj
Jurnal Teknik ITS, 2015 Teknik modulasi multilevel seperti M-ary Quadrature Amplitude Modulation (M-QAM) memiliki kelemahan yaitu semakin tinggi level modulasi yang digunakan, maka semakin tinggi pula nilai BER yang dihasilkan.
Nadya Noor Oktarini +2 more
doaj
New Construction of Maximum Distance Separable (MDS) Self-Dual Codes over Finite Fields
Entropy, 2019 Maximum distance separable (MDS) self-dual codes have useful properties due to their optimality with respect to the Singleton bound and its self-duality.
Aixian Zhang, Zhe Ji
doaj +1 more source
Makara Seri Sains, 2006 Reed Solomon (RS) codes is a mechanism to detect and correct burst of errors in data transmission and storage systems. It provides a solid introduction to foundation mathematical concept of Galois Field algebra and its application.
Petrus Mursanto
doaj
The Dimension of Subcode-Subfields of Shortened Generalized Reed Solomon Codes
, 2011 Reed-Solomon (RS) codes are among the most ubiquitous codes due to their good parameters as well as efficient encoding and decoding procedures. However, RS codes suffer from having a fixed length.
Hernando, Fernando +2 more
core +1 more source
METHODS FOR IMPROVING THE PERFORMANCE OF DECODING STREAMING DATA BASED ON THE REED – SOLOMON CODE
Надежность и качество сложных системBackground. Decoding information using noise-tolerant Reed–Solomon codes is a very resource-intensive task in part of calculation imlpementation. This problem is especially relevant when video streams or telemetry decoding on the fly, in a time mode ...
M.Yu. Zvyozdochkin, V.V. Mironov
doaj +1 more source
Robust Reed Solomon Coded MPSK Modulation
Journal of ICT Research and Applications, 2014 In this paper, construction of partitioned Reed Solomon coded modulation (RSCM), which is robust for the additive white Gaussian noise channel and a Rayleigh fading channel, is investigated.
Emir M. Husni
doaj
Affine Cartesian codes with complementary duals
, 2018 A linear code $C$ with the property that $C \cap C^{\perp} = \{0 \}$ is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD.
López, Hiram H. +2 more
core
Optimal rate list decoding via derivative codes
, 2011 The classical family of $[n,k]_q$ Reed-Solomon codes over a field $\F_q$ consist of the evaluations of polynomials $f \in \F_q[X]$ of degree $< k$ at $n$ distinct field elements. In this work, we consider a closely related family of codes, called (order $
Carol Wang +3 more
core +3 more sources