Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 31 for “"list decoding"”.
-
Adaptive and iterative list decoding
This thesis presents an efficient iterative list-decoding algorithm for Reed-Solomon (RS) codes by adaptively adjust its list size. Specially, we propose a stop criterion for iterative decoder. Once it is met, the iterative decoder stops and generates desirable decoded output. Simulation results …
-
Error correcting codes: local testing, list decoding, and applications
… be useful for efficient constructions of probabilistically checkable proofs. Our analysis also enables us to obtain a self-corrector for the given function, in case the function is reasonably close to a codeword. Specifically, we show that the value of the function at any given point may be …
-
MULTIVARIATE LIST DECODING OF EVALUATION CODES WITH A GRÖBNER BASIS PERSPECTIVE
Please download dissertation to view abstract.
-
List decoding expander-based codes via fast approximation of expanding CSPs
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2027-08-01
-
Analysis, improvement and extensions of a Lee metric list decoding algorithm for alternant codes
… Lee metric codes based on the Guruswami-Sudan decoding and Ido Tal algorithms are studied in this thesis. An algorithm is developped over a Galois ring, some improvements in special cases are given as for large alphabet codes and codes over GF(2). Tools are developped to study Lee metric codes …
-
Enhanced quality reconstruction of erroneous video streams using packet filtering based on non-desynchronizing bits and UDP checksum-filtered list decoding
… other hand, error correction approaches, such as list decoding, exploit the corrupted packets to generate several candidate transmitted packets from the corrupted received packet. They then select, among these candidates, the one with the highest likelihood of being the transmitted packet based on …
-
DECODING OF MULTIPOINT ALGEBRAIC GEOMETRY CODES VIA LISTS
… code. In this dissertation, we wish to develop a decoding algorithm for multipoint codes. We show how we can embed a multipoint algebraic geometry code into a one-point supercode so that we can perform list decoding in the supercode. From the output list, we determine which of the elements is a …
-
Θεωρία πληροφορίας και επεξεργασία σήματος για (μη-γραμμικά) επικοινωνιακά κανάλια
In this thesis, error decoding probability bounds and achievable rates for linear and nonlinear communications channels are presented. Gallager's upper bound as well as its variations through the Duman--Salehi bound are improved. The proposed technique relies on the new inverse exponential sum …
-
Concatenated Polar Codes and Joint Source-Channel Decoding
… successive cancellation or belief propagation decoding. The performance of concatenated polar and convolutional codes can be comparable to stand-alone polar codes with list decoding in the high signal to noise ratio regime. In addition to this, we show that the proposed concatenation schemes …
-
Distance and Symmetry: Two Pillars of a Good Code
… results: 1) Any linear code that achieves list decoding capacity and has superconstant minimum distance also achieves capacity on the symmetric channel. 2) For any linear code C with large enough generalized distances, the bit-decoding and block-decoding thresholds of C on the erasure …
-
Simplified decoding techniques for linear block codes
… original data from received word. The classical decoding algorithms are constrained to output just one codeword. However, in the late 50’s researchers proposed a relaxed error correction model for potentially large error rates known as list decoding. The research presented in this thesis focuses …
-
Decoding algorithms for algebraic geometric codes over rings
… and studied in the late 1990's by Walker, but no decoding algorithm was given. In this dissertation, we present three decoding algorithms for algebraic geometric codes over rings. The first algorithm presented is a modification of the basic algorithm for algebraic geometric codes over fields, and …
-
Decentralized Web Search
… using phonetic codes and n-grams along with list decoding of a linear covering code. DEWS supports incremental retrieval of search results in a decentralized manner which reduces network bandwidth required for query resolution. It uses an efficient routing mechanism extending the Plexus …
-
Channel Detection and Decoding With Deep Learning
… (FTN) signalling, soft-decision decoding algorithms for high-density parity-check codes and user identification for massive machine-type communications (mMTC). These wireless communication research problems are addressed by the employment of deep learning and an outline of the …
-
Gröbner basis techniques for certain problems in coding and systems theory
… approach leads to efficient algorithms in the decoding of Reed-Solomon codes and in scalar interpolation and partial realization. This thesis simultaneously generalizes and simplifies that approach and presents applications to discrete-time modeling, multivariable interpolation and list …
-
Numerical decoding, Johnson-Lindenstrauss transforms, and linear codes
… problems. One problem is related to efficient decoding for Reed-Solomon codes over complex numbers. In this case, A and y are given, and the goal is to find an efficient stable algorithm to compute x. This is related to magnetic resonance imaging (MRI). The other problem is related to fast …
-
Algebraic approaches to distributed compression and network error correction
… LDPC codes and show that algebraic soft-decision decoding of Reed-Solomon codes can be used effectively under certain correlation structures. As part of this work we have proposed a method that adapts list decoding for the problem of syndrome decoding. This in turn allows us to arrive at improved …
-
Analyzing massive datasets with missing entries: models and algorithms
… We then investigate the problems of local decoding and local list decoding of codewords containing erasures. We show that, in some cases, these problems are strictly easier than the corresponding problems of decoding codewords containing errors. Moreover, we use this understanding to show a …
-
Algebraic and analytic techniques in coding theory
… have been corrupted. This is called the unique decoding problem of error correcting codes. More precisely, if the user wants to send K bits, the code stretches K bits to N bits to tolerate errors in the N bits. Then the goal is to recover the original K bits of the message. Often, the receiver …
Page 1 of 2