Results 31 to 40 of about 1,469,827 (288)
Modified Nested Barker Codes for Ultra-Wideband Signal–Code Constructions
Sensors, 2023 Currently, various applications of ultra-wideband signal–code constructions are among the most vibrant technologies, being implemented in very different fields. The purpose of this research consists of analyzing Barker codes and searching for the optimal
Vadim A. Nenashev +4 more
doaj +1 more source
THE CONVOLUTIONAL CODESАNALYSIS TECHNIQUE ON THE OPTIMUM BLOCK CODES GROUNDS
Information and Telecommunication Sciences, 2014 The convolutional codes analysis and synthesis technique is proposed. This technique is optimal according to near Shannon's bound criterion and guarantees a given bit error rate from message source.
Leonid Uryvskyi +2 more
doaj +1 more source
Describing quaternary codes using binary codes [PDF]
, 2011 PhDFor a quaternary code C of length n, de ne a pair of binary codes fC1;C2g as: -C1 = C mod 2 -C2 = h(C \ 2Zn 4 ) where h is a bijection from 2Z4 to Z2 mapping 0 to 0 and 2 to 1 and for the extension to a map acting coordinatewise.
Al Kharoosi, Fatma Salim Ali
core +4 more sources
Buildings, 2020 Although base isolation is nowadays a well-established seismic-protection technique for both buildings and bridges, and several issues are still open and attract the interest of the research community.
Adamo Zinco +3 more
doaj +1 more source
On linear equivalence and Phelps codes
Advances in Mathematics of Communications, 2010 It is shown that all non-full-rank FRH-codes, a class of perfect codes we define in this paper, are linearly equivalent to perfect codes obtainable by Phelps' construction. Moreover, it is shown by an example that the class of perfect FRH-codes also contains perfect codes that are not obtainable by Phelps construction.
Olof Heden, Martin Hessler
openaire +2 more sources
ABOUT CODE EQUIVALENCE — A GEOMETRIC APPROACH
, 2022 The equivalence test is a main part in any classification problem. It helps to prove bounds for the main parameters of the considered combinatorial structures and to study their properties. In this paper, we present algorithms for equivalence of linear codes, based on their relation to multisets of points in a projective geometry.
Iliya Bouyukliev, Stefka Bouyuklieva
openaire +3 more sources
Low-complexity trellis decoding of linear block codes. [PDF]
, 1995 The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed ...
Markarian, G. S. +2 more
core +4 more sources
Avoiding coherent errors with rotated concatenated stabilizer codes
npj Quantum Information, 2021 Coherent errors, which arise from collective couplings, are a dominant form of noise in many realistic quantum systems, and are more damaging than oft considered stochastic errors.
Yingkai Ouyang
doaj +1 more source
On the equivalence of linear cyclic and constacyclic codes
Discrete Mathematics, 2023 We introduce new sufficient conditions for permutation and monomial equivalence of linear cyclic codes over various finite fields. We recall that monomial equivalence and isometric equivalence are the same relation for linear codes over finite fields.
Reza Dastbasteh, Petr Lisonek
openaire +5 more sources
Graph-Based Codes and Iterative Decoding [PDF]
, 2003 The field of error correcting codes was revolutionized by the introduction of turbo codes in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity.
Khandekar, Aamod Dinkar
core +1 more source