• No results found

Minimum Distance for Systematic Linear Codes

On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

... the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been ...

11

A note on reducing the computation time for minimum distance and equivalence check of binary linear codes

A note on reducing the computation time for minimum distance and equivalence check of binary linear codes

... the minimum distance of a linear code, and also efficient ways to check codes for equivalence when there are memory ...to linear codes, self-dual codes, combinatorial ...

6

Computation of Minimum Hamming Weight for Linear Codes

Computation of Minimum Hamming Weight for Linear Codes

... the minimum Hamming weight for a linear code of arbitrary ...free linear code. This algorithm then easily computes the minimum Hamming weight of the code generated by this ...

13

A generalized floor bound for the minimum distance of geometric Goppa codes

A generalized floor bound for the minimum distance of geometric Goppa codes

... error-correcting codes using two divisors on a curve. He also gives a distance bound based on the degrees of the ...actual minimum distance of the one-point Hermitian and certain one-point ...

10

Minimum Distance and Convergence Analysis of Hamming-Accumulate-Acccumulate Codes

Minimum Distance and Convergence Analysis of Hamming-Accumulate-Acccumulate Codes

... of codes formed by the serial concatenation of a Hamming code and two accumulate ...most codes in the ensemble have minimum distance growing linearly with the block ...resulting codes ...

6

The relax codes for linear minimum cost network flow problems

The relax codes for linear minimum cost network flow problems

... Speedup factor of RELAX-II and RELAXT-II over RNET in lightly capaci- rated transhipment problems generated by our own random problem generator RANET.. Each node is a tr[r] ...

66

Primal-Dual  Distance  Bounds  of  Linear  Codes  with  Application  to  Cryptography

Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography

... The true values for the minimum length are also determined by exhaustive search for certain range of parameters. These lower bounds and true values are useful for estimating the necessary input length of ...

6

On an algorithm for classification of binary self-dual codes with minimum distance four

On an algorithm for classification of binary self-dual codes with minimum distance four

... self-dual codes for a given length is a quite interesting and challenging problem in coding ...inequivalent codes grows very fast with respect to the ...self-dual codes of length 36 by Harada and ...

6

Bent  functions  at  the  minimal  distance   and  algorithms  of  constructing  linear  codes  for  CDMA

Bent functions at the minimal distance and algorithms of constructing linear codes for CDMA

... This is the standard for the 3rd Generation cellular communications systems. In this standard bent functions are used for constructing codes of constant amplitude. This application allows to decrease PAPR ...

6

Distance Spectrum of Fixed-Rate Raptor Codes with Linear Random Precoders

Distance Spectrum of Fixed-Rate Raptor Codes with Linear Random Precoders

... the minimum distance of a code randomly drawn from the ensemble has a linear growth with the block ...Raptor codes. These results are particularly useful for fixed-rate Raptor codes ...

14

Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding: (Invited Paper)

Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding: (Invited Paper)

... component codes in order to assess their reliabilities even when no channel reliability information is available, was ...component codes, named iBDD with scaled reliability ...LDPC codes, while still ...

6

Minimum Linear Arrangement of Trees

Minimum Linear Arrangement of Trees

... π(x) otherwise All the lengths within each subtree remain the same, as do all the distances from v to the roots of the subtrees, except for the distance from v to the root of T 2 . This length is decreased by i − ...

31

The equivalence of linear codes implies semi-linear equivalence

The equivalence of linear codes implies semi-linear equivalence

... equivalent linear codes then they are semi-linearly ...Hamming distance preserving bijection of F n which maps subspaces to subspaces then this map is semi-linear, ...

10

Algebraic methods for the distance of cyclic codes

Algebraic methods for the distance of cyclic codes

... Cyclic codes In this section we introduce the principal aspects concerning an important subclass of linear codes: cyclic ...these codes, in fact from an algebraic point of view, the ...

197

A New Powerful Scheme Based on Self Invertible Stabilizer Multiplier Permutation to Find the Minimum Distance for large BCH Codes

A New Powerful Scheme Based on Self Invertible Stabilizer Multiplier Permutation to Find the Minimum Distance for large BCH Codes

... the minimum distance search problem of BCH ...the minimum distance of the reduced dimension sub code fixed by a Self Invertible Stabilizer Multiplier Permutation by Zimmermann ...BCH ...

5

A Low Complexity Detection Scheme of Space Frequency Codes for MIMO OFDM  Systems with Minimum Euclidean Distance Metric Calculation

A Low Complexity Detection Scheme of Space Frequency Codes for MIMO OFDM Systems with Minimum Euclidean Distance Metric Calculation

... frequency codes (SFC) is proposed for MIMO- OFDM systems with a low complexity detection ...novel minimum Euclidean distance metric calculation method followed by decision ...SFC codes. ...

5

Linear Authentication Codes: Bounds and Constructions

Linear Authentication Codes: Bounds and Constructions

... of codes with desirable properties such as having the minimum possible deception probabilities and the minimum number of ...optimal codes, a combinatorial approach is ...

7

Seven new champion linear codes

Seven new champion linear codes

... the minimum distance of successful trial ...of codes that pass our four-line trial in Step 5, we can always calculate the minimum distance within a few hours, and there are several ...

10

On products of linear error correcting codes

On products of linear error correcting codes

... As shown in Chapter 1, the motivation for a systematic code-theoretic study of squares is quite strong. With a view to contributing to such an endeavor, our concern in this chapter is with the dimension of squares ...

149

Approximate MDS Property of Linear Codes

Approximate MDS Property of Linear Codes

... of linear codes with super-linear field size and use the probabilistic method to show that for nearly all such codes, the corresponding weight spectrum is very close to that of a maximum ...

6

Show all 10000 documents...

Related subjects