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 92 for “"linear codes"”.
-
Z₄-linear codes
… channels. It is know that certain nonlinear codes satisfy the MacWilliams Identity. Much research has been done to explain this relation- ship. In the early 1990's, five coding theorists discovered that nonlinear codes have linear properties if viewed under the alphabet Z<sub>4</sub> …
-
Essential dimension and linear codes
… dimension of G/μ. To do this, we first attach a linear ‘code’ to the central subgroup μ, and define a weight function on this code. Our upper and lower bounds are given in terms of a minimal weight generator matrix for the code. In some cases we can determine the exact value of the essential …
-
On the undetected error probability of linear codes
… for the primitive triple-error-correcting BCH codes of blocklength 2[formula omitted] 1, used solely for error detection on a binary symmetric channel with crossover probability є ≤ 1/2, is examined. It is shown that for odd values of m, P[formula omitted(є) increases monotonically with є. …
-
Classification of small optimal linear codes over Z₄
… the construction and classification of Z4 linear codes for lengths up to 7. Three distance metrics are considered, Lee distance, Hamming distance and Euclidean distance. The inequivalent codes are determined from the optimal codes constructed. Self-orthogonal codes, self-dual codes, isodual …
-
Numerical decoding, Johnson-Lindenstrauss transforms, and linear codes
… 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 algorithms for projecting …
-
Contributions to the decoding of linear codes over Z4
… hard and soft decision decoding techniques for linear codes over Z4, all of which, offer substantial coding gains over classical algebraic decoding. We focus only on codes which are free, i.e., (n, k, d) linear codes whose canonical images over GF(2) are (n, k) linear codes of the same minimum …
-
Applications of ordered weights in information transmission
… dissertation is devoted to a study of a class of linear codes related to a particular metric space that generalizes the Hamming space in that the metric function is defined by a partial order on the set of coordinates of the vector. We begin with developing combinatorial and linear-algebraic …
-
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>
-
Multiplicative codes of Reed-Muller type
This is a comprehensive study of multiplicative codes of Reed-Muller type and their applications. Our codes apply to the elds of cryptography and coding theory, especially to multiparty computa- tion and secret sharing schemes. We also study the AB method to analyze the minimum distance of linear …
-
Algebraic geometric codes over rings
… widely and successfully applied to the study of linear codes over finite fields since the early 1980's. Recently, there has been an increased interest in the study of linear codes over finite rings. In this thesis, we combine these two approaches to coding theory by introducing and studying …
-
Developments in Nonlinear Codes and Distance Preserving Maps
Linear codes are generally easier to construct and correct errors than nonlinear codes. However, for some parameters nonlinear binary codes are more efficient than any linear binary code. Some of these codes can be constructed as linear codes in higher powers of two and then converted to binary …
Page 1 of 5