Loading [MathJax]/extensions/MathMenu.js

Yuhuai Wang - IEEE Xplore Author Profile

Scheduled Maintenance on Monday 1/13/2025

Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.

IEEE.org
IEEE Xplore
IEEE SA
IEEE Spectrum
More Sites

- Donate
- Personal Sign In

Access provided by:

MIT Libraries

Access provided by:

MIT Libraries

ADVANCED SEARCH

Author details

Yuhuai Wang

Also published under: Y. H. Wang

Publications

14

Citations

59

Publications by Year

20202023

Co-Authors:

Hao Chen
H. Chen
R. ChenC. DongJianan Dong

Show All Co-Authors (46)

Yuhuai Wang

Also published under: Y. H. Wang

Affiliation

Key Laboratory of Smart Grid of Education Ministry

School of Electrical and Information Engineering

Tianjin University, Tianjin, China

Publication Topics

Surface Charge,
Charge Accumulation,
Negatively Charged,
Charge Density,
Surface Conductivity,
Al2O3 Particles,
Alternating Current,
Surface Flashover,
Alumina Particles,
Amount Of Charge,
Behavior Of Particles,
Breakdown Strength

Biography

Yuhuai Wang (Graduate Student Member, IEEE) was born in Inner Mongolia, China, in 1997. He received the B.S. degree in electrical engineering from the Inner Mongolia University of Technology, Hohhot, China, in 2018. He is currently pursuing the master’s degree with the School of Electrical Engineering and Automation, Tianjin University, Tianjin, China.,His main research interests include insulation and mechanical failures of gas insulated switchgear and gas insulated transmission line (GIS/GIL).(Based on document published on 29 June 2022).

Publications

14

Citations

59

Publications by Year

20202023

Co-Authors:

Hao Chen
H. Chen
R. Chen
C. Dong
Jianan Dong

Show All Co-Authors (46)

Author's Published Works

Search History

Showing 1-25 of 154 results

Conferences (93)

Journals (58)

Magazines (2)

Early Access Articles (1)

Sort

Filter Results

Show

Subscribed Content

Open Access Only

Range
Single Year
Gianluigi Liva(150)
Enrico Paolini(45)
Marco Chiani(37)
Alexandre Graell i Amat(24)
Balazs Matuz(17)
Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden(18)
Institute of Communications and Navigation, German Aerospace Center (DLR), Wessling, Germany(13)
Institute of Communications and Navigation, German Aerospace Center (DLR), Weßling, Germany(9)
Institute for Communications Engineering, Technical University of Munich, Munich, Germany(8)
Institute for Telecommunication, Hamburg University of Technology, Hamburg, Germany(7)
IEEE Transactions on Communications(21)
IEEE Communications Letters(16)
IEEE Transactions on Information Theory(5)
2011 IEEE International Conference on Communications (ICC)(4)
2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)(4)
IEEE(153)
KICS(1)
Media(1)
Pacific Grove, CA, USA(9)
Hong Kong, China(6)
Baltimore, MD, USA(4)
Kyoto, Japan(4)
Paris, France(4)
Low-density Parity-check Codes(97)
Low-density Parity-check(91)
Variable Nodes(66)
Parity-check Matrix(58)
Linear Code(52)

Select All on Page

Sort By

Results

Undetected Error Probability in the Short Blocklength Regime: Approaching Finite-Blocklength Bounds with Polar Codes

Alexander Sauter;A. Oguz Kislal;Giuseppe Durisi;Gianluigi Liva;Balázs Matuz;Erik G. Ström

IEEE Transactions on Communications

Year: 2025 | Early Access Article |

We analyze the trade-off between the undetected error probability (i.e., the probability that the channel decoder outputs an erroneous message without detecting the error) and the total error probability in the short blocklength regime. We address the problem by developing two new finite blocklength achievability bounds, which we use to benchmark the performance of two coding schemes based on pola...Show More

Undetected Error Probability in the Short Blocklength Regime: Approaching Finite-Blocklength Bounds with Polar Codes

Alexander Sauter;A. Oguz Kislal;Giuseppe Durisi;Gianluigi Liva;Balázs Matuz;Erik G. Ström

IEEE Transactions on Communications

Year: 2025 | Early Access Article |

Rate-Adaptive Protograph-Based MacKay-Neal Codes

Ayman Zahr;Emna Ben Yacoub;Balázs Matuz;Gianluigi Liva

IEEE Transactions on Information Theory

Year: 2025 | Volume: 71, Issue: 2 | Journal Article |

HTML

Rate-adaptive MacKay-Neal (MN) codes based on protographs are analyzed. The code construction employs an outer distribution matcher (DM) to adapt the rate of the scheme. The DM is coupled with an inner protograph-based low-density parity-check (LDPC) code. The performance achievable by the resulting code structure, that is nonlinear, is studied by means of an equivalent communication model that re...Show More

Rate-Adaptive Protograph-Based MacKay-Neal Codes

Ayman Zahr;Emna Ben Yacoub;Balázs Matuz;Gianluigi Liva

IEEE Transactions on Information Theory

Year: 2025 | Volume: 71, Issue: 2 | Journal Article |

Enhancements to the 5G-NR 2-Step RACH: an Unsourced Multiple Access Perspective

Patrick Agostini;Jean-Francois Chamberland;Federico Clazzer;Johannes Dommel;Gianluigi Liva;Andrea Munari;Krishna Narayanan;Yury Polyanskiy;Slawomir Stanczak;Zoran Utkovski

2024 IEEE Conference on Standards for Communications and Networking (CSCN)

Year: 2024 | Conference Paper |

HTML

The ever increasing demand for massive connectivity, combined with the specific characteristics of machinegenerated wireless traffic, is pushing the existing solutions for device registration and data transfer beyond their operational limits. In this paper, we target specifically the 3GPP 5G New Radio random access channel, proposing some enhancements inspired by recent research results in the fie...Show More

Enhancements to the 5G-NR 2-Step RACH: an Unsourced Multiple Access Perspective

Patrick Agostini;Jean-Francois Chamberland;Federico Clazzer;Johannes Dommel;Gianluigi Liva;Andrea Munari;Krishna Narayanan;Yury Polyanskiy;Slawomir Stanczak;Zoran Utkovski

2024 IEEE Conference on Standards for Communications and Networking (CSCN)

Year: 2024 | Conference Paper |

Age of Information for Frame Asynchronous Coded Slotted ALOHA

Houman Asgari;Andrea Munari;Gianluigi Liva

ICC 2024 - IEEE International Conference on Communications

Year: 2024 | Conference Paper |

HTML

The rapid growth of loT applications in which a large number of devices need to deliver information to a central monitor in a timely fashion has focused attention on the age of information performance of random access protocols. This paper provides the first study of one such strategy, Frame Asynchronous Coded Slotted ALOHA (FA-CSA) Through de-tailed network simulations, we compare its performance...Show More

Age of Information for Frame Asynchronous Coded Slotted ALOHA

Houman Asgari;Andrea Munari;Gianluigi Liva

ICC 2024 - IEEE International Conference on Communications

Year: 2024 | Conference Paper |

Unsourced Multiple Access: A Coding Paradigm for Massive Random Access

Gianluigi Liva;Yury Polyanskiy

Proceedings of the IEEE

Year: 2024 | Volume: 112, Issue: 9 | Journal Article |

Cited by: Papers (2)

HTML

This article is a tutorial introduction to the field of unsourced multiple access (UMAC) protocols. We first provide a historical survey of the evolution of random access protocols, focusing specifically on the case in which uncoordinated users share a wireless broadcasting medium. Next, we highlight the change of perspective originated by the UMAC model, in which the physical and medium access la...Show More

Unsourced Multiple Access: A Coding Paradigm for Massive Random Access

Gianluigi Liva;Yury Polyanskiy

Proceedings of the IEEE

Year: 2024 | Volume: 112, Issue: 9 | Journal Article |

Error-Correction Performance of Regular Ring-Linear LDPC Codes Over Lee Channels

Jessica Bariffi;Hannes Bartz;Gianluigi Liva;Joachim Rosenthal

IEEE Transactions on Information Theory

Year: 2024 | Volume: 70, Issue: 11 | Journal Article |

HTML

Most low-density parity-check (LDPC) code constructions are considered over finite fields. In this work, we focus on regular LDPC codes over integer residue rings and analyze their performance with respect to the Lee metric. Their error-correction performance is studied over two channel models, in the Lee metric. The first channel model is a discrete memoryless channel, whereas in the second chann...Show More

Error-Correction Performance of Regular Ring-Linear LDPC Codes Over Lee Channels

Jessica Bariffi;Hannes Bartz;Gianluigi Liva;Joachim Rosenthal

IEEE Transactions on Information Theory

Year: 2024 | Volume: 70, Issue: 11 | Journal Article |

Trends in Channel Coding for 6G

Sisi Miao;Claus Kestel;Lucas Johannsen;Marvin Geiselhart;Laurent Schmalen;Alexios Balatsoukas-Stimming;Gianluigi Liva;Norbert Wehn;Stephan Ten Brink

Proceedings of the IEEE

Year: 2024 | Volume: 112, Issue: 7 | Journal Article |

Cited by: Papers (2)

HTML

Error correction coding (i.e., channel coding) is a key ingredient of any digital communications system. In mobile wireless communications, channel codes have evolved from simple convolutional codes in Global System for Mobile Communications (GSM) (2G), parallel concatenated (turbo) codes in Universal Mobile Telecommunications Service (UMTS) (3G), and long-term evolution (LTE) (4G), to carefully d...Show More

Trends in Channel Coding for 6G

Sisi Miao;Claus Kestel;Lucas Johannsen;Marvin Geiselhart;Laurent Schmalen;Alexios Balatsoukas-Stimming;Gianluigi Liva;Norbert Wehn;Stephan Ten Brink

Proceedings of the IEEE

Year: 2024 | Volume: 112, Issue: 7 | Journal Article |

Design and Performance of Enhanced Spread Spectrum Aloha for Unsourced Multiple Access

Riccardo Schiavone;Gianluigi Liva;Roberto Garello

IEEE Communications Letters

Year: 2024 | Volume: 28, Issue: 8 | Journal Article |

Cited by: Papers (2)

HTML

We analyze the performance of enhanced spread spectrum Aloha (E-SSA) in the framework of unsourced multiple access (UMAC). The asynchronous, unframed transmission of E-SSA is modified to enable a direct comparison with framed UMAC schemes and with Polyanskiy’s achievability bound. The design of E-SSA is tailored to the UMAC setting, resorting to short polar codes and the use of a timing channel to...Show More

Design and Performance of Enhanced Spread Spectrum Aloha for Unsourced Multiple Access

Riccardo Schiavone;Gianluigi Liva;Roberto Garello

IEEE Communications Letters

Year: 2024 | Volume: 28, Issue: 8 | Journal Article |

Remote Monitoring of Markov Sources over Random Access Channels: False Alarm and Detection Probability

Andrea Munari;Giuseppe Cocco;Gianluigi Liva

2023 57th Asilomar Conference on Signals, Systems, and Computers

Year: 2023 | Conference Paper |

HTML

We study the problem of remote source monitoring in an Internet of Things (IoT) system where a set of devices share a wireless channel to a common receiver. Each device observes an independent two-state Markov chain, with one of the states visited sporadically (modeling a critical event), and may transmit the current source value following a slotted ALOHA contention. We focus on protocols that set...Show More

Remote Monitoring of Markov Sources over Random Access Channels: False Alarm and Detection Probability

Andrea Munari;Giuseppe Cocco;Gianluigi Liva

2023 57th Asilomar Conference on Signals, Systems, and Computers

Year: 2023 | Conference Paper |

Remote Monitoring of Two-State Markov Sources via Random Access Channels: An Information Freshness vs. State Estimation Entropy Perspective

Giuseppe Cocco;Andrea Munari;Gianluigi Liva

IEEE Journal on Selected Areas in Information Theory

Year: 2023 | Volume: 4 | Journal Article |

Cited by: Papers (7)

HTML

We study a system in which two-state Markov sources send status updates to a common receiver over a slotted ALOHA random access channel. We characterize the performance of the system in terms of state estimation entropy (SEE), which measures the uncertainty at the receiver about the sources’ state. Two channel access strategies are considered: a reactive policy that depends on the source behaviour...Show More

Remote Monitoring of Two-State Markov Sources via Random Access Channels: An Information Freshness vs. State Estimation Entropy Perspective

Giuseppe Cocco;Andrea Munari;Gianluigi Liva

IEEE Journal on Selected Areas in Information Theory

Year: 2023 | Volume: 4 | Journal Article |

Soft-Information Post-Processing for Chase-Pyndiah Decoding Based on Generalized Mutual Information

Andreas Straßhofer;Diego Lentner;Gianluigi Liva;Alexandre Graell i Amat

2023 12th International Symposium on Topics in Coding (ISTC)

Year: 2023 | Conference Paper |

Cited by: Papers (4)

HTML

Chase-Pyndiah decoding is widely used for decoding product codes. However, this method is suboptimal and requires scaling the soft information exchanged during the iterative processing. In this paper, we propose a framework for obtaining the scaling coefficients based on maximizing the generalized mutual information. Our approach yields gains up to 0.11 dB for product codes with two-error correcti...Show More

Soft-Information Post-Processing for Chase-Pyndiah Decoding Based on Generalized Mutual Information

Andreas Straßhofer;Diego Lentner;Gianluigi Liva;Alexandre Graell i Amat

2023 12th International Symposium on Topics in Coding (ISTC)

Year: 2023 | Conference Paper |

Finite Blocklength Performance Bound for the DNA Storage Channel

Issam Maarouf;Gianluigi Liva;Eirik Rosnes;Alexandre Graell i Amat

2023 12th International Symposium on Topics in Coding (ISTC)

Year: 2023 | Conference Paper |

HTML

We present a finite blocklength performance bound for a DNA storage channel with insertions, deletions, and substitutions. The considered bound—the dependency testing (DT) bound, introduced by Polyanskiy et at. in 2010—, provides an upper bound on the achievable frame error probability and can be used to benchmark coding schemes in the practical short-to-medium blocklength regime. In particular, w...Show More

Finite Blocklength Performance Bound for the DNA Storage Channel

Issam Maarouf;Gianluigi Liva;Eirik Rosnes;Alexandre Graell i Amat

2023 12th International Symposium on Topics in Coding (ISTC)

Year: 2023 | Conference Paper |

The Dynamic Behavior of Frameless ALOHA: Drift Analysis, Throughput, and Age of Information

Andrea Munari;Francisco Lázaro;Giuseppe Durisi;Gianluigi Liva

IEEE Transactions on Communications

Year: 2023 | Volume: 71, Issue: 12 | Journal Article |

Cited by: Papers (8)

HTML

We study the dynamic behavior of frameless ALOHA, both in terms of throughput and age of information (AoI). In particular, differently from previous studies, our analysis accounts for the fact that the number of terminals contending the channel may vary over time, as a function of the duration of the previous contention period. The stability of the protocol is analyzed via a drift analysis, which ...Show More

The Dynamic Behavior of Frameless ALOHA: Drift Analysis, Throughput, and Age of Information

Andrea Munari;Francisco Lázaro;Giuseppe Durisi;Gianluigi Liva

IEEE Transactions on Communications

Year: 2023 | Volume: 71, Issue: 12 | Journal Article |

Analysis of Binary and Ternary Message Passing Decoding for Generalized LDPC Codes

Emna Ben Yacoub;Gianluigi Liva

IEEE Transactions on Communications

Year: 2023 | Volume: 71, Issue: 9 | Journal Article |

HTML

The performance of generalized low-density parity-check (GLDPC) codes under binary and ternary message passing decoding (BMP/TMP) is analyzed from a density evolution (DE) perspective. At the check nodes, two types of local decoders are considered, namely optimum a-posteriori probability (APP) soft-input soft-output decoding, and bounded distance decoding (BDD). The purpose is to shed light on the...Show More

Analysis of Binary and Ternary Message Passing Decoding for Generalized LDPC Codes

Emna Ben Yacoub;Gianluigi Liva

IEEE Transactions on Communications

Year: 2023 | Volume: 71, Issue: 9 | Journal Article |

State Estimation Entropy for Two-State Markov Sources in Slotted ALOHA Random Access Channels

Giuseppe Cocco;Andrea Munari;Gianluigi Liva

2023 IEEE Information Theory Workshop (ITW)

Year: 2023 | Conference Paper |

Cited by: Papers (2)

HTML

We study a system in which terminals monitoring two-state Markov sources communicate towards a common receiver over a slotted ALOHA random access channel. We analyze the system performance in terms of state estimation entropy (SEE), which measures the uncertainty at the receiver about the sources’ state. Two channel access strategies are studied, one that is influenced by the source behaviour and ...Show More

State Estimation Entropy for Two-State Markov Sources in Slotted ALOHA Random Access Channels

Giuseppe Cocco;Andrea Munari;Gianluigi Liva

2023 IEEE Information Theory Workshop (ITW)

Year: 2023 | Conference Paper |

Rate-Adaptive Protograph MacKay-Neal Codes

Ayman Zahr;Balazs Matuz;Gianluigi Liva

2023 IEEE Information Theory Workshop (ITW)

Year: 2023 | Conference Paper |

Cited by: Papers (1)

HTML

A class of rate-adaptive protograph MacKay-Neal (MN) codes is introduced and analyzed. The code construction employs an outer distribution matcher (DM) to adapt the rate of the scheme. The DM is coupled with an inner protograph-based low-density parity-check (LDPC) code, whose base matrix is optimized via density evolution analysis to approach the Shannon limit of the binary-input additive white G...Show More

Rate-Adaptive Protograph MacKay-Neal Codes

Ayman Zahr;Balazs Matuz;Gianluigi Liva

2023 IEEE Information Theory Workshop (ITW)

Year: 2023 | Conference Paper |

Performance Improvement of Space Missions Using Convolutional Codes by CRC-Aided List Viterbi Algorithms

Riccardo Schiavone;Roberto Garello;Gianluigi Liva

Year: 2023 | Volume: 11 | Journal Article |

Cited by: Papers (7)

HTML

Recently, CRC-aided list decoding of convolutional codes has gained attention thanks to its remarkable performance in the short blocklength regime. This paper studies the convolutional and CRC codes of the Consultative Committee for Space Data System Telemetry recommendation used in space missions by all international space agencies. The distance spectrum of the concatenated CRC-convolutional code...Show More

Performance Improvement of Space Missions Using Convolutional Codes by CRC-Aided List Viterbi Algorithms

Riccardo Schiavone;Roberto Garello;Gianluigi Liva

Year: 2023 | Volume: 11 | Journal Article |

Error Detection Strategies for CRC-Concatenated Polar Codes under Successive Cancellation List Decoding

Alexander Sauter;Balázs Matuz;Gianluigi Liva

2023 57th Annual Conference on Information Sciences and Systems (CISS)

Year: 2023 | Conference Paper |

Cited by: Papers (5)

HTML

In this work we introduce a framework to study the trade-off between the undetected error rate (UER) and overall frame error rate (FER) of CRC-concatenated polar codes in the short blocklength regime. Three approaches to improve the tradeoff under successive cancellation list (SCL) decoding are outlined. Two techniques are based on the optimum threshold test introduced by Forney in 1968, whereas a...Show More

Error Detection Strategies for CRC-Concatenated Polar Codes under Successive Cancellation List Decoding

Alexander Sauter;Balázs Matuz;Gianluigi Liva

2023 57th Annual Conference on Information Sciences and Systems (CISS)

Year: 2023 | Conference Paper |

Trapping and Absorbing Set Enumerators for Nonbinary Protograph-Based Low-Density Parity-Check Code Ensembles

Emna Ben Yacoub;Gianluigi Liva

IEEE Transactions on Communications

Year: 2023 | Volume: 71, Issue: 4 | Journal Article |

Cited by: Papers (3)

HTML

The finite-length trapping and (elementary) absorbing set enumerators for nonbinary protograph-based LDPC code ensembles are derived. Both constrained and unconstrained edge labeling approaches are considered. The normalized logarithmic asymptotic distributions of trapping and (elementary) absorbing sets are obtained through an efficient method that requires solving a system of equations. Using th...Show More

Trapping and Absorbing Set Enumerators for Nonbinary Protograph-Based Low-Density Parity-Check Code Ensembles

Emna Ben Yacoub;Gianluigi Liva

IEEE Transactions on Communications

Year: 2023 | Volume: 71, Issue: 4 | Journal Article |

Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding

Mustafa Cemil Coşkun;Gianluigi Liva;Alexandre Graell i Amat;Michael Lentmaier;Henry D. Pfister

IEEE Transactions on Information Theory

Year: 2023 | Volume: 69, Issue: 2 | Journal Article |

Cited by: Papers (3)

HTML

A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to the constraints imposed by the product code construction. Following this observation, successive cancellation decoding of such codes is introduced. In particular, the error probability of single parity-check product code...Show More

Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding

Mustafa Cemil Coşkun;Gianluigi Liva;Alexandre Graell i Amat;Michael Lentmaier;Henry D. Pfister

IEEE Transactions on Information Theory

Year: 2023 | Volume: 69, Issue: 2 | Journal Article |

Implementation of Short-Packet Physical-Layer Network Coding

Shakeel Salamat Ullah;Soung Chang Liew;Gianluigi Liva;Taotao Wang

IEEE Transactions on Mobile Computing

Year: 2023 | Volume: 22, Issue: 1 | Journal Article |

Cited by: Papers (7)

HTML

This paper presents the implementation and experimental evaluation of a short-packet physical-layer network coding (PNC) system. Implementation of short-packet PNC systems is challenging. First, short packets may have only a few pilot symbols for synchronization and channel estimation purposes. Increasing the number of pilots increases the overhead; decreasing the number of pilots, on the other ha...Show More

Implementation of Short-Packet Physical-Layer Network Coding

Shakeel Salamat Ullah;Soung Chang Liew;Gianluigi Liva;Taotao Wang

IEEE Transactions on Mobile Computing

Year: 2023 | Volume: 22, Issue: 1 | Journal Article |

Coded Slotted Aloha with Stopping Set Resolution: A Group Testing Approach

Alexandre Graelli Amat;Gianluigi Liva;Enrico Paolini;Cedomir Stefanovic

2022 56th Asilomar Conference on Signals, Systems, and Computers

Year: 2022 | Conference Paper |

Cited by: Papers (1)

HTML

In this work, we explore the use of group testing techniques to steer a collision resolution phase in the context of coded slotted Aloha protocols. The problem can be defined as the discovery of stopping sets based on the residual collision pattern after successive interference cancellation decoding. We show how the application of the simple combinatorial orthogonal matching pursuit algorithm is s...Show More

Coded Slotted Aloha with Stopping Set Resolution: A Group Testing Approach

Alexandre Graelli Amat;Gianluigi Liva;Enrico Paolini;Cedomir Stefanovic

2022 56th Asilomar Conference on Signals, Systems, and Computers

Year: 2022 | Conference Paper |

Sparse Graph Codes for the 2-User Unsourced MAC

Alexander Fengler;Gianluigi Liva;Yury Polyanskiy

2022 56th Asilomar Conference on Signals, Systems, and Computers

Year: 2022 | Conference Paper |

Cited by: Papers (2)

HTML

We study the design of low-density parity check (LDPC) codes for the 2-user binary adder channel (BAC) in the unsourced setting. That is, both users employ the same code. We show that classic design criteria for LDPC codes do not capture the special requirements needed to deal with the interference in an unsourced BAC (UBAC). Instead, we give a graph theoretic analysis that allows to calculate the...Show More

Sparse Graph Codes for the 2-User Unsourced MAC

Alexander Fengler;Gianluigi Liva;Yury Polyanskiy

2022 56th Asilomar Conference on Signals, Systems, and Computers

Year: 2022 | Conference Paper |

Analysis of Low-Density Parity-Check Codes over Finite Integer Rings for the Lee Channel

Jessica Bariffi;Hannes Bartz;Gianluigi Liva;Joachim Rosenthal

GLOBECOM 2022 - 2022 IEEE Global Communications Conference

Year: 2022 | Conference Paper |

Cited by: Papers (1)

HTML

We study the performance of nonbinary low-density parity-check (LDPC) codes over finite integer rings over two channels that arise from the Lee metric. The first channel is a discrete memory-less channel (DMC) matched to the Lee metric. The second channel adds to each codeword an error vector of constant Lee weight, where the error vector is picked uniformly at random from the set of vectors of co...Show More

Analysis of Low-Density Parity-Check Codes over Finite Integer Rings for the Lee Channel

Jessica Bariffi;Hannes Bartz;Gianluigi Liva;Joachim Rosenthal

GLOBECOM 2022 - 2022 IEEE Global Communications Conference

Year: 2022 | Conference Paper |

Application of List Viterbi Algorithms to Improve the Performance in Space Missions using Convolutional Codes

Riccardo Schiavone;Roberto Garello;Gianluigi Liva

2022 9th International Workshop on Tracking, Telemetry and Command Systems for Space Applications (TTC)

Year: 2022 | Conference Paper |

Cited by: Papers (3)

HTML

Currently, several space missions are still using convolutional codes, which are among the available coding options of the CCSDS telemetry recommendation. When convolutional codes are employed, the CCSDS specification mandates the use of an outer CRC code to perform error detection over the transfer frame. Alternatively, the CRC code may be used, together with list Viterbi decoding of the inner co...Show More

Application of List Viterbi Algorithms to Improve the Performance in Space Missions using Convolutional Codes

Riccardo Schiavone;Roberto Garello;Gianluigi Liva

2022 9th International Workshop on Tracking, Telemetry and Command Systems for Space Applications (TTC)

Year: 2022 | Conference Paper |

IEEE Personal Account

Change username/password

Purchase Details

Payment Options
View Purchased Documents

Profile Information

Communications Preferences
Profession and Education
Technical interests

Need Help?

US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support

Follow

About IEEE Xplore | Contact Us | Help | Accessibility | Terms of Use | Nondiscrimination Policy | IEEE Ethics Reporting | Sitemap | IEEE Privacy Policy

A public charity, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.

© Copyright 2025 IEEE - All rights reserved, including rights for text and data mining and training of artificial intelligence and similar technologies.

IEEE Account

Change Username/Password
Update Address

Purchase Details

Payment Options
Order History
View Purchased Documents

Profile Information

Communications Preferences
Profession and Education
Technical Interests

Need Help?

US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support

About IEEE Xplore
Contact Us
Help
Accessibility
Terms of Use
Nondiscrimination Policy
Sitemap
Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

Test Whats new message.