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 34 for “"Reed-Muller codes"”.
-
Reed - muller codes
<p>The Reed Muller codes are a class of multiple error correcting linear codes with a geometry.</p> <p>This paper investigates some properties of this code, describes two decoding schemes, and looks at the efficiency of these codes according to three bounds on linear codes.</p>
-
Fast generation and covering radius of Reed-Muller Codes
Reed-Muller codes are known to be some of the oldest, simplest and most elegant error correcting codes. Reed-Muller codes were invented in 1954 by D. E. Muller and I. S. Reed, and were an important extension of the Hamming and Golay codes because they gave more flexibility in the size of the …
-
A New Family of Fault Tolerant Quantum Reed-Muller Codes
… computation. Rengaswamy et. al. define CSS-T codes, which are CSS codes that admit the transversal application of the T gate, which is a key step in achieving fault tolerant computation. They then present a family of quantum Reed-Muller fault tolerant codes. Their family of codes admits a …
-
Reed-Muller codes in error correction in wireless adhoc networks
… fading affects. In the stan-dard, convolutional codes are used for error correction. This thesis examines the perform-ance of the COFDM system with variable rate Reed-Muller (RM) error correction codes with a goal to reduce the peak-to-average power ratio (PAPR). Contrary to the expecta-tions, RM …
-
Commutative algebra and coding theory, with applications to quantum error-correction
… Algebra to derive properties of linear codes. We focus mainly on evaluation codes, since they have a natural connection to Commutative Algebra, but we also consider other types of codes such as cyclic codes (which can be viewed as subfield subcodes of evaluation codes) or matrix-product …
-
Physical layer network coding based on compute-and-forward
… two scenarios using zero order and second order Reed-Muller codes and first and third order Reed-Muller codes. Finally, we extend our system model using construction D and existing conventional decoders to include coefficient selection algorithms. We employ an exhaustive search algorithm and …
-
Distance and Symmetry: Two Pillars of a Good Code
… and symmetry in the design of error correcting codes. Our main measure of distance will be the minimum distance of a code, i.e., the smallest number of coordinates any two codewords may differ in. Our main criterion for symmetry will be transitivity, i.e., the requirement that any two …
-
Codes and Sequences for Information Retrieval and Stream Ciphers
Given a self-similar structure in codes and de Bruijn sequences, recursive techniques may be used to analyze and construct them. Batch codes partition the indices of code words into m buckets, where recovery of t symbols is accomplished by accessing at most tau in each bucket. This finds use in the …
-
Spatial processing, Power Control, and channel allocation for OFDM wireless communications
… increase the information rate of low PAPR OFDM codes, we propose two frameworks. Super Golay sequences constructed from 16QAM constellation having PAPR bounded up to 3dB are defined, and constructed by recursive structures. Cyclic-Golay codes are also proposed and constructed by a framework that …
-
Graphical CSS Code Transformation Using ZX Calculus
… we present a generic approach to transform CSS codes by building upon their equivalence to phase-free ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic transformations between encoding maps associated with different codes. As a motivating example, we give explicit transformations …
-
Autentifikavimo schemos, naudojančios klaidas taisančius kodus /
… there is a relationship between error-correcting codes and authentication codes. The thing is, that authentication codes can be constructed using error-correcting codes and visa versa. The objective of the work was to determine what error-correcting codes are the most suitable for constructing …
-
PERMUTATION DECODING OF CODES FROM GRAPHS AND DESIGNS
… this method was used originally on cyclic codes and Golay codes. In this dissertation we study binary codes formed from an adjacency matrix of some classes of graphs and apply the permutation decoding method to these codes. First we do a literature survey on the permutation decoding method …
-
New Directions From Old Codes
Reed-Muller (RM) codes form a classic family studied for its interesting algebraic and combinatorial properties as well as from the perspective of information transmission. They achieve Shannon capacity of the basic binary channel models such as channels with independent erasures or flip errors. …
-
Some issues in enabling technologies for high data rate reliable wireless communications: OFDM and adaptive ARQ
… are presented. We study PAPR behavior of some Reed-Muller codes in OFDM systems in an attempt to find a code with good error correction, low PAPR, efficient encoding/decoding and reasonable code rate. Some regularities of the second and third-order cosets of first order Reed-Muller codes with …
-
Belief Propagation with Deep Unfolding for High-dimensional Inference in Communication Systems
… back-propagation. For recursive decoding for Reed–Muller codes, the algebraic structure of the code is utilized and a recursive BP approach for redundant factor graphs is developed for near-optimal decoding. Finally, we use deep unfolding to unroll BP decoding as a recursive neural network and …
Page 1 of 2