AbstractThe combinatorics of reduced Gröbner bases of certain zero-dimensional ideals, which arise when Gröbner basis technique is applied to the soft-decision maximum likelihood decoding of binary linear block codes, will be studied
AbstractThe interpolation step of Guruswami and Sudan’s list decoding of Reed–Solomon codes poses th...
In this chapter, we discuss decoding techniques and finding the minimum distance of linear codes wit...
We specialize Möller’s algorithm to the computation of Gröbner bases related to lattices. We give th...
This paper shows how Gröbner basis techniques can be used in coding theory, especially in the constr...
In this thesis the relationship between Gröbner bases and algebraic coding theory is investigated, a...
New algorithms for the soft-derision and the hard-derision maximum likelihood decoding (MLD) for bin...
AbstractThe Gröbner bases of the ideal generated by the symmetric functions are presented. Moreover ...
This paper introduces a new efficient algorithm, called MXL3, for computing Gröbner bases of zero-di...
In this chapter we discuss decoding techniques and finding the minimum distance of linear codes with...
Two new implementations of a maximum-likelihood soft-decision decoding algorithm for binary linear c...
Soft-decision decoding is an NP-hard problem of great interest to developers of com-munication syste...
We demonstrate an efficient method for computing a Gröbner basis of a zero-dimensional ideal describ...
The decoding of arbitrary linear block codes is accomplished by solving a system of quadratic equati...
Coding theory plays an important role in efficient transmission of data over noisy channels.In this ...
International Telemetering Conference Proceedings / November 14-16, 1978 / Hyatt House Hotel, Los An...
AbstractThe interpolation step of Guruswami and Sudan’s list decoding of Reed–Solomon codes poses th...
In this chapter, we discuss decoding techniques and finding the minimum distance of linear codes wit...
We specialize Möller’s algorithm to the computation of Gröbner bases related to lattices. We give th...
This paper shows how Gröbner basis techniques can be used in coding theory, especially in the constr...
In this thesis the relationship between Gröbner bases and algebraic coding theory is investigated, a...
New algorithms for the soft-derision and the hard-derision maximum likelihood decoding (MLD) for bin...
AbstractThe Gröbner bases of the ideal generated by the symmetric functions are presented. Moreover ...
This paper introduces a new efficient algorithm, called MXL3, for computing Gröbner bases of zero-di...
In this chapter we discuss decoding techniques and finding the minimum distance of linear codes with...
Two new implementations of a maximum-likelihood soft-decision decoding algorithm for binary linear c...
Soft-decision decoding is an NP-hard problem of great interest to developers of com-munication syste...
We demonstrate an efficient method for computing a Gröbner basis of a zero-dimensional ideal describ...
The decoding of arbitrary linear block codes is accomplished by solving a system of quadratic equati...
Coding theory plays an important role in efficient transmission of data over noisy channels.In this ...
International Telemetering Conference Proceedings / November 14-16, 1978 / Hyatt House Hotel, Los An...
AbstractThe interpolation step of Guruswami and Sudan’s list decoding of Reed–Solomon codes poses th...
In this chapter, we discuss decoding techniques and finding the minimum distance of linear codes wit...
We specialize Möller’s algorithm to the computation of Gröbner bases related to lattices. We give th...
DOI
Add to ORKG