Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guillaume Larue

dblp:287/2826 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0003-1989-4246ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 1 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Coding theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › decoding › iterative decoding
belief propagation decoding
1.422025
Learning Linear Block Codes With Gradient Quantization · IEEE Trans. Commun. 2025
Neural Belief Propagation Auto-Encoder for Linear Block Code Design · IEEE Trans. Commun. 2022
Coding theory › error-correcting codes › decoding
decoding algorithms
0.912025
Learning Linear Block Codes With Gradient Quantization · IEEE Trans. Commun. 2025
Coding theory › error-correcting codes › block codes
linear block codes
0.912025
Learning Linear Block Codes With Gradient Quantization · IEEE Trans. Commun. 2025
Coding theory › error-correcting codes
forward error correction
0.612022
Neural Belief Propagation Auto-Encoder for Linear Block Code Design · IEEE Trans. Commun. 2022

Methods — techniques the papers use, named apart from their topics

random search · 0.9gradient quantization · 0.9discrete-valued weight optimizers · 0.9neural belief propagation · 0.6machine learning · 0.6autoencoder · 0.6
YearPublicationVenuePosition
2025 Target Handover in Distributed Integrated Sensing and Communication
abstract
The concept of 6G distributed integrated sensing and communications (DISAC) builds upon the functionality of integrated sensing and communications (ISAC) by integrating distributed architectures, significantly enhancing both sensing and communication coverage and performance. In 6G DISAC systems, tracking target trajectories requires base stations (BSs) to hand over their tracked targets to neighboring BSs. Determining what information to share, where, how, and when is critical to effective handover. This paper addresses the target handover challenge in DISAC systems and introduces a method enabling BSs to share essential target trajectory information at appropriate time steps, facilitating seamless handovers to other BSs. The target tracking problem is tackled using the standard trajectory Poisson multi-Bernoulli mixture (TPMBM) filter, enhanced with the proposed handover algorithm. Simulation results confirm the effectiveness of the implemented tracking solution.
Yu Ge 0002, Ossi Kaltiokallio, Hui Chen 0014, Jukka Talvitie, Yuxuan Xia, Giyyarpuram Madhusudan, Guillaume Larue, Lennart Svensson, Mikko Valkama, Henk Wymeersch
ICC7
2025 Learning Linear Block Codes With Gradient Quantization
abstract
This study investigates the problem of learning linear block codes optimized for Belief-Propagation decoders significantly improving performance compared to the state-of-the-art. Our previous research is extended with an enhanced system design that facilitates a more effective learning process for the parity check matrix. We simplify the input dataset, restrict the number of parameters to learn and improve the gradient back-propagation within the model. We also introduce novel optimizers specifically designed for discrete-valued weights. Based on conventional gradient computation, these optimizers provide discrete weights updates, enabling finer control and improving explainability of the learning process. Through these changes, we consistently achieve improved code performance, provided appropriately chosen hyper-parameters. To rigorously evaluate the performance of learned codes in the context of short to medium block lengths, we propose a comprehensive code performance assessment framework. This framework enables a fair comparison between our learning methodology and random search approaches, ensuring statistical significance in our results. The proposed model pave the way for a new approach to the efficient learning of linear block codes tailored to specific decoder structures.
Louis-Adrien Dufrène, Quentin Lampin, Guillaume Larue
IEEE Trans. Commun.3
2022 Neural Belief Propagation Auto-Encoder for Linear Block Code Design
abstract
The growing number of Internet of Thing (IoT) and Ultra-Reliable Low Latency Communications (URLCC) use cases in next generation communication networks calls for the development of efficient Forward Error Correction (FEC) mechanisms. These use cases usually imply using short to mid-sized information blocks and requires low-complexity and/or fast decoding procedures. This paper investigates the joint learning of short to mid block-length coding schemes and associated Belief-Propagation (BP) like decoders using Machine Learning (ML) techniques. An interpretable auto-encoder (AE) architecture is proposed, ensuring scalability to block sizes currently challenging for ML-based linear block code design approaches. By optimizing a coding scheme w.r.t. the targeted decoder, the proposed system offers a good complexity/performance trade-off compared to various codes from literature with length up to 128 bits.
Guillaume Larue, Louis-Adrien Dufrène, Quentin Lampin, Hadi Ghauch, Ghaya Rekaya-Ben Othman
IEEE Trans. Commun.1