#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2002

2018

- This year (7)
- Last 5 years (30)
- Last 10 years (47)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Peter Trifonov
- IEEE Transactions on Communications
- 2012

Polar codes are shown to be instances of both generalized concatenated codes and multilevel codes. It is shown that the performance of a polar code can be improved by representing it as a multilevelâ€¦ (More)

- Peter Trifonov, Sergei V. Fedorenko
- Probl. Inf. Transm.
- 2003

â€”We consider the problem of fast computation of the Fourier transform over a finite field by decomposing an arbitrary polynomial into a sum of linearized polynomials. Examples of algorithms for theâ€¦ (More)

- Peter Trifonov, Piotr Semenov
- 2011 8th International Symposium on Wirelessâ€¦
- 2011

Polar codes are demonstrated to be instances of both generalized concatenated codes and multilevel codes. It is shown that Gaussian approximation for density evolution enables one to accuratelyâ€¦ (More)

- Elena Costa, Sergei V. Fedorenko, Peter Trifonov
- European Transactions on Telecommunications
- 2004

Application of the cyclotomic Fast Fourier Transform algorithm to the syndrome evaluation problem in classical Reed-Solomon decoders is described. A number of complexity reduction tricks isâ€¦ (More)

- Sergei V. Fedorenko, Peter Trifonov
- IEEE Trans. Communications
- 2002

In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-Solomon and someâ€¦ (More)

- Piotr Semenov, Peter Trifonov
- IEEE Communications Letters
- 2012

A generalization of the BCH bound to the case of quasi-cyclic codes is proposed. The new approach is based on eigenvalues of matrix polynomials. This results in improved minimum distance estimatesâ€¦ (More)

- Peter Trifonov
- 2007

The problem of fast evaluation of a matrix-vector product over GF (2) is considered. The problem is reduced to erasure decoding of a linear error-correcting code. A large set of redundant parityâ€¦ (More)

- Peter Trifonov
- 2010 IEEE Region 8 International Conference onâ€¦
- 2010

A novel derivation of the Wu list decoding algorithm for Reed-Solomon codes is provided. The algorithm is reformulated as construction of a partially homogenized interpolation polynomial. Aâ€¦ (More)

- Peter Trifonov, Moon Ho Lee
- IEEE Transactions on Information Theory
- 2012

The interpolation step of the Wu list decoding algorithm for Reedâ€“Solomon codes is considered. The problem is reformulated as construction of a partially homogenized interpolation polynomial. Aâ€¦ (More)

- Peter Trifonov
- IEEE Transactions on Information Theory
- 2010

A novel algorithm is proposed for the interpolation step of the Guruswami-Sudan list decoding algorithm. The proposed method is based on the binary exponentiation algorithm, and can be considered asâ€¦ (More)