Search

Search Results

1. On deep holes of standard Reed-Solomon codes

   Determining deep holes is an important open problem in decoding Reed-Solomon codes. It is well known that the received word is trivially a deep hole...

   RongJun Wu, ShaoFang Hong in Science China Mathematics

   Article 23 August 2012

2. Rational maps and maximum likelihood decodings

   This paper studies maximum likelihood (ML) decoding in error-correcting codes as a rational map and proposes a new approximate ML decoding rule by...

   Kazunori Hayashi, Yasuaki Hiraoka in Japan Journal of Industrial and Applied Mathematics

   Article 11 November 2011

3. Codes and designs from triangular graphs and their line graphs

   Washiela Fish, Khumbo Kumwenda, Eric Mwambene in Central European Journal of Mathematics

   Article 30 July 2011

4. Testing algebraic geometric codes

   Property testing was initially studied from various motivations in 1990’s. A code C ⊂ GF ( r ) ⁿ is locally testable if there is a randomized algorithm...

   Hao Chen in Science in China Series A: Mathematics

   Article 08 August 2009

5. The generalized Goertzel algorithm and its parallel hardware implementation

   Reed-Solomon (RS) and Bose-Chaudhuri-Hocquenghem (BCH) error correcting codes are widely used in digital technology. An important problem in the...

   Chen Hao, Chen GongLiang, Li JianHua in Science in China Series A: Mathematics

   Article 01 January 2008

6. O

   M. Hazewinkel in Encyclopaedia of Mathematics

   Chapter 1997
   

7. G

   M. Hazewinkel in Encyclopaedia of Mathematics

   Chapter 1997
   

8. K

   M. Hazewinkel in Encyclopaedia of Mathematics

   Chapter 1997
   

9. O

   Michiel Hazewinkel in Encyclopaedia of Mathematics

   Chapter 1995
   

10. O

    M. Hazewinkel in Encyclopaedia of Mathematics

    Chapter 1994
    

11. O

    M. Hazewinkel in Encyclopaedia of Mathematics

    Chapter 1990