Peter Trifonov

Orcid: 0000-0001-6960-0942

Affiliations:
  • Saint-Petersburg Polytechnic University, Distributed Computing and Networking Department


According to our database1, Peter Trifonov authored at least 77 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Recursive Soft-Input Soft-Output Decoding Algorithm.
IEEE Trans. Commun., March, 2024

2023
Recursive Processing Algorithm for Low Complexity Decoding of Polar Codes With Large Kernels.
IEEE Trans. Commun., September, 2023

Distributed Video Coding Based on Polar Codes.
IEEE Commun. Lett., March, 2023

Design and Decoding of Polar Codes with Large Kernels: A Survey.
Probl. Inf. Transm., January, 2023

Efficient Evaluation of Polarization Behavior for Large Kernels.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Design of Multilevel Polar Codes with Shaping.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Dual-domain recursive SISO decoding of linear block codes.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Window Processing of Binary Polarization Kernels.
IEEE Trans. Commun., 2021

Relaxed Decoding of Polar Codes With Large Kernels.
IEEE Commun. Lett., 2021

Privacy, Secrecy, and Storage with Nested Randomized Polar Subcode Constructions.
IACR Cryptol. ePrint Arch., 2021

Bidirectional search application for polar codes with large kernels.
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

A recursive SISO decoding algorithm.
Proceedings of the IEEE Information Theory Workshop, 2021

Recursive Trellis Processing of Large Polarization Kernels.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Fast Block Sequential Decoding of Polar Codes.
IEEE Trans. Veh. Technol., 2020

Randomized Polar Subcodes With Optimized Error Coefficient.
IEEE Trans. Commun., 2020

Design of BCH Polarization Kernels With Reduced Processing Complexity.
IEEE Commun. Lett., 2020

An Approximate Method for Construction of Polar Codes With Kernels Over F<sub>2<sup>t</sup></sub>.
IEEE Commun. Lett., 2020

Performance and Complexity of the Sequential Successive Cancellation Decoding Algorithm.
CoRR, 2020

Efficient decoding of polar codes with some 16$\times$16 kernels.
CoRR, 2020

Randomized Nested Polar Subcode Constructions for Privacy, Secrecy, and Storage.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Recursive Trellis Decoding Techniques of Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Successive and Two-Stage Systematic Encoding of Polar Subcodes.
IEEE Wirel. Commun. Lett., 2019

On Distance Properties of Convolutional Polar Codes.
IEEE Trans. Commun., 2019

Design and Decoding of Polar Codes with a Mixture of Reed-Solomon and Arikan Kernels.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

Construction of binary polarization kernels for low complexity window processing.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Trellis-based Decoding Techniques for Polar Codes with Large Kernels.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Reduced complexity window processing of binary polarization kernels.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On Construction of Polar Subcodes with Large Kernels.
Proceedings of the IEEE International Symposium on Information Theory, 2019

A Lower Bound on Minimum Distance of Convolutional Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Block Sequential Decoding Techniques for Polar Subcodes.
CoRR, 2018

Randomized chained polar subcodes.
Proceedings of the 2018 IEEE Wireless Communications and Networking Conference Workshops, 2018

Chained successive cancellation decoding of the extended Golay code.
Proceedings of the Iran Workshop on Communication and Information Theory, 2018

Efficient decoding of polar codes with some 16×16 kernels.
Proceedings of the IEEE Information Theory Workshop, 2018

Reduced Complexity Decoding of Polar Codes with Reed-Solomon Kernel.
Proceedings of the 2018 Information Theory and Applications Workshop, 2018

Efficient SC Decoding of Convolutional Polar Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Algebraic Matching Techniques for Fast Decoding of Polar Codes with Reed-Solomon Kernel.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

A Score Function for Sequential Decoding of Polar Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Fast Sequential Decoding of Polar Codes.
CoRR, 2017

Star Polar Subcodes.
Proceedings of the 2017 IEEE Wireless Communications and Networking Conference Workshops, 2017

A randomized construction of polar subcodes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Fast Encoding of Polar Codes With Reed-Solomon Kernel.
IEEE Trans. Commun., 2016

Polar Subcodes.
IEEE J. Sel. Areas Commun., 2016

Hybrid decoding of interlinked generalized concatenated codes.
Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 2016

Generalized Concatenated Codes for Block and Device Failure Protection.
Proceedings of the 2016 IEEE International Conference on Computer and Information Technology, 2016

2015
Low-Complexity Implementation of RAID Based on Reed-Solomon Codes.
ACM Trans. Storage, 2015

Multilevel buckets for sequential decoding of polar codes.
Proceedings of the 26th IEEE Annual International Symposium on Personal, 2015

Block sequential decoding of polar codes.
Proceedings of the 2015 International Symposium on Wireless Communication Systems (ISWCS), 2015

Design of polar codes for Rayleigh fading channel.
Proceedings of the 2015 International Symposium on Wireless Communication Systems (ISWCS), 2015

2014
Successive cancellation decoding of Reed-Solomon codes.
Probl. Inf. Transm., 2014

Correction to "Spectral Method for Quasi-Cyclic Code Analysis".
IEEE Commun. Lett., 2014

Sequential Decoding of Polar Codes.
IEEE Commun. Lett., 2014

Successive cancellation permutation decoding of Reed-Solomon codes.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Sequential decoding of polar codes with arbitrary binary kernel.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Twisted polar codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Sequential decoding of Reed-Solomon codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Binary successive cancellation decoding of polar codes with Reed-Solomon kernel.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Polar codes with dynamic frozen symbols and their decoding by directed search.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

2012
Efficient Interpolation in the Wu List Decoding Algorithm.
IEEE Trans. Inf. Theory, 2012

Efficient Design and Decoding of Polar Codes.
IEEE Trans. Commun., 2012

Spectral Method for Quasi-Cyclic Code Analysis.
IEEE Commun. Lett., 2012

On the additive complexity of the cyclotomic FFT algorithm.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Design of binary polar codes with arbitrary kernel.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

2011
Generalized concatenated codes based on polar codes.
Proceedings of the 8th International Symposium on Wireless Communication Systems, 2011

Hybrid interpolation algorithm for algebraic soft decision decoding of Reed-Solomon codes.
Proceedings of the 8th International Symposium on Wireless Communication Systems, 2011

A concatenated coding scheme based on folded Reed-Solomon codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Efficient interpolation in the Guruswami-Sudan algorithm.
IEEE Trans. Inf. Theory, 2010

2007
Interpolation in list decoding of Reed-Solomon codes.
Probl. Inf. Transm., 2007

Adaptive Data Transmission in Downlink MIMO-OFDM Systems with Pre-Equalization.
Proceedings of IEEE International Conference on Communications, 2007

2006
Joint Adaptation of Code Length and Modulation Formats in OFDM Systems.
Proceedings of the IEEE 17th International Symposium on Personal, 2006

2004
Adaptive coding in MC-CDMA/FDMA systems with adaptive sub-band allocation.
Eur. Trans. Telecommun., 2004

On computing the syndrome polynomial in Reed-Solomon decoder.
Eur. Trans. Telecommun., 2004

Location based adaptive sub-band allocation for multi carrier multiple access systems.
Proceedings of the IEEE 15th International Symposium on Personal, 2004

Divide-and-conquer interpolation for list decoding of reed-solomon codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
A Method for Fast Computation of the Fourier Transform over a Finite Field.
Probl. Inf. Transm., 2003

Improved hybrid algorithm for finding roots of error-locator polynomials.
Eur. Trans. Telecommun., 2003

MC-CDMA uplink channel coding scheme with built-in channel estimation.
Proceedings of IEEE International Conference on Communications, 2003

2002
Finding roots of polynomials over finite fields.
IEEE Trans. Commun., 2002


  Loading...