World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
50
Citations
17313
World Ranking
5485
National Ranking
114

Research.com Recognitions

  • 2006 - IEEE Fellow For contributions to coding and decoding methods.

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Statistics
  • Algebra

His scientific interests lie mostly in Algorithm, Decoding methods, Low-density parity-check code, Sequential decoding and List decoding. His study looks at the intersection of Algorithm and topics like Theoretical computer science with Additive white Gaussian noise. The Decoding methods study combines topics in areas such as Computational complexity theory and Iterative method.

His research integrates issues of Binary code, Binary number, Belief propagation, Parity bit and Error detection and correction in his study of Low-density parity-check code. He focuses mostly in the field of Sequential decoding, narrowing it down to topics relating to Viterbi decoder and, in certain cases, Convolutional code. His study in List decoding is interdisciplinary in nature, drawing from both Berlekamp–Welch algorithm and Error floor.

His most cited work include:

  • Low-density parity-check codes based on finite geometries: a rediscovery and new results (1241 citations)
  • Reduced complexity iterative decoding of low-density parity check codes based on belief propagation (831 citations)
  • Reduced-complexity decoding of LDPC codes (802 citations)

What are the main themes of his work throughout his whole career to date?

Algorithm, Decoding methods, Low-density parity-check code, Block code and Linear code are his primary areas of study. His research investigates the connection between Algorithm and topics such as Theoretical computer science that intersect with problems in Coding gain. The Decoding methods study combines topics in areas such as Computational complexity theory, Additive white Gaussian noise, Code, Binary code and Upper and lower bounds.

His Low-density parity-check code research includes themes of Discrete mathematics, Binary erasure channel, Belief propagation and Binary number. In his study, Phase-shift keying is inextricably linked to Communication channel, which falls within the broad field of Block code. His biological study spans a wide range of topics, including List decoding and Parity bit.

He most often published in these fields:

  • Algorithm (61.84%)
  • Decoding methods (53.95%)
  • Low-density parity-check code (39.91%)

What were the highlights of his more recent work (between 2007-2019)?

  • Low-density parity-check code (39.91%)
  • Discrete mathematics (31.14%)
  • Algorithm (61.84%)

In recent papers he was focusing on the following fields of study:

His primary areas of study are Low-density parity-check code, Discrete mathematics, Algorithm, Decoding methods and Block code. The various areas that Marc P. C. Fossorier examines in his Low-density parity-check code study include Binary erasure channel, Turbo code and Binary number. The concepts of his Discrete mathematics study are interwoven with issues in Upper and lower bounds, Parity bit, Linear code and Combinatorics.

His Algorithm research incorporates elements of Additive white Gaussian noise and Theoretical computer science. His work carried out in the field of Decoding methods brings together such families of science as Binary code and Error detection and correction. His study looks at the relationship between Block code and topics such as Type, which overlap with Code word.

Between 2007 and 2019, his most popular works were:

  • Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images (275 citations)
  • Low-complexity decoding for non-binary LDPC codes in high order fields (160 citations)
  • Generalized and Doubly Generalized LDPC Codes With Random Component Codes for the Binary Erasure Channel (44 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Statistics
  • Algebra

The scientist’s investigation covers issues in Low-density parity-check code, Discrete mathematics, Algorithm, Decoding methods and Error detection and correction. His Error floor study in the realm of Low-density parity-check code interacts with subjects such as Process. His Discrete mathematics study incorporates themes from Block code, Combinatorics and Parity bit.

His work on Linear code and Channel code as part of general Algorithm study is frequently linked to GRASP and Field, therefore connecting diverse disciplines of science. His Linear code research incorporates themes from Probabilistic logic, Turbo code and Concatenated error correction code. His study in the field of Hamming weight and List decoding is also linked to topics like Noise measurement.

Best Publications

  • Low-density parity-check codes based on finite geometries: a rediscovery and new results

    Y. Kou;S. Lin;M.P.C. Fossorier

  • Reduced complexity iterative decoding of low-density parity check codes based on belief propagation

    M.P.C. Fossorier;M. Mihaljevic;H. Imai

  • Reduced-complexity decoding of LDPC codes

    Jinghu Chen;A. Dholakia;E. Eleftheriou;M.P.C. Fossorier

  • Near optimum universal belief propagation based decoding of low-density parity check codes

    Jinghu Chen;M.P.C. Fossorier

  • Soft decision decoding of linear block codes based on ordered statistics

    M.P.C. Fossorier;Shu Lin

  • Decoding Algorithms for Nonbinary LDPC Codes Over GF $(q)$

    D. Declercq;M. Fossorier

  • Density evolution for two improved BP-Based decoding algorithms of LDPC codes

    J. Chen;M.P.C. Fossorier

  • Two simple stopping criteria for turbo decoding

    R.Y. Shao;Shu Lin;M.P.C. Fossorier

  • Shuffled iterative decoding

    Juntan Zhang;M.P.C. Fossorier

  • Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

    Marc Fossorier;Tom Høholdt;Alain Poli

  • Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images

    C. Poulliat;M. Fossorier;D. Declercq

  • A modified weighted bit-flipping decoding of low-density Parity-check codes

    Juntan Zhang;M.P.C. Fossorier

  • Low-complexity decoding for non-binary LDPC codes in high order fields

    Adrian Voicila;David Declercq;Francois Verdier;Marc Fossorier

  • On the equivalence between SOVA and max-log-MAP decodings

    M.P.C. Fossorier;F. Burkert;Shu Lin;J. Hagenauer

  • Iterative reliability-based decoding of low-density parity check codes

    M.P.C. Fossorier

  • Iterative decoding of one-step majority logic deductible codes based on belief propagation

    R. Lucas;M.P.C. Fossorier;Yu Kou;Shu Lin

  • On the computation of the minimum distance of low-density parity-check codes

    Xiao-Yu Hu;M.P.C. Fossorier;E. Eleftheriou

  • Box and match techniques applied to soft-decision decoding

    A. Valembois;M. Fossorier

  • Two decoding algorithms for tailbiting codes

    R.Y. Shao;Shu Lin;M.P.C. Fossorier

  • Fast correlation attack algorithm with list decoding and an application

    Miodrag J. Mihaljevic;Marc P. C. Fossorier;Hideki Imai

  • Quasi-Cyclic Low-Density Parity-Check Codes From

    Marc P. C. Fossorier

  • Comment on "Quasi-Cyclic Low Density Parity Check Codes From Circulant Permutation Matrices"

    M. Hagiwara;M. Fossorier

Frequent Co-Authors

Shu Lin
Shu Lin University of California, Davis
Hideki Imai
Hideki Imai Chuo University
Marco Chiani
Marco Chiani University of Bologna
David Declercq
David Declercq CY Cergy Paris University
Tadao Kasami
Tadao Kasami Nara Institute of Science and Technology
Aleksandar Kavcic
Aleksandar Kavcic University of Hawaii at Manoa
Zixiang Xiong
Zixiang Xiong Texas A&M University
Desmond P. Taylor
Desmond P. Taylor University of Canterbury
Zhi Ding
Zhi Ding University of California, Davis

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online education opens up flexible options for those interested in Computer Science and related fields. For students looking to build foundational skills, associates degrees online offer an affordable and convenient way to start a technology career or transfer credits toward a bachelor’s degree.

Budget considerations are important. Many prospective students seek affordable online colleges to maximize their return on investment while minimizing debt. These schools often provide robust support and flexible schedules.

Not everyone has a perfect academic record—fortunately, there are online graduate programs that accept 2.0 gpa. These programs create opportunities for career advancement even if your GPA is below traditional cutoffs.

Finally, if you’re interested in fields beyond Computer Science, there are many pathways to consider. Discover the diverse roles and industries available with a science background by exploring what can you do with an environmental science major.

Best Scientists Citing Marc P. C. Fossorier

Trending Scientists