标题
Hybrid Coupled Serially Concatenated Codes
作者
关键词
-
出版物
IEEE TRANSACTIONS ON COMMUNICATIONS
Volume 70, Issue 7, Pages 4301-4315
出版商
Institute of Electrical and Electronics Engineers (IEEE)
发表日期
2022-05-17
DOI
10.1109/tcomm.2022.3175525
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- Spatially coupled serially concatenated codes via parity re‐encoding
- (2021) Shancheng Zhao et al. ELECTRONICS LETTERS
- Analysis and Design of Partially Information- and Partially Parity-Coupled Turbo Codes
- (2021) Min Qiu et al. IEEE TRANSACTIONS ON COMMUNICATIONS
- Doubly-Recursive Block Markov Superposition Transmission: A Low-Complexity and Flexible Coding Scheme
- (2020) Shancheng Zhao et al. IEEE TRANSACTIONS ON COMMUNICATIONS
- Spatially Coupled LDPC Codes With Small Constraint Length and Low Error Floor
- (2019) Sima Naseri et al. IEEE COMMUNICATIONS LETTERS
- Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes With Large Girth
- (2018) Mohammad H. Tadayon et al. IEEE COMMUNICATIONS LETTERS
- Partially Information-Coupled Turbo Codes for LTE Systems
- (2018) Lei Yang et al. IEEE TRANSACTIONS ON COMMUNICATIONS
- Recursive Block Markov Superposition Transmission of Short Codes: Construction, Analysis, and Applications
- (2018) Shancheng Zhao et al. IEEE TRANSACTIONS ON COMMUNICATIONS
- Braided Convolutional Codes With Sliding Window Decoding
- (2017) Min Zhu et al. IEEE TRANSACTIONS ON COMMUNICATIONS
- Spatially Coupled Turbo-Like Codes
- (2017) Saeedeh Moloudi et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Performance Analysis of Block Markov Superposition Transmission of Short Codes
- (2016) Kechao Huang et al. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
- Time-Invariant Quasi-Cyclic Spatially Coupled LDPC Codes Based on Packings
- (2016) Mu Zhang et al. IEEE TRANSACTIONS ON COMMUNICATIONS
- Block Markov Superposition Transmission: Construction of Big Convolutional Codes From Short Codes
- (2015) Xiao Ma et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Spatially Coupled LDPC Codes Constructed From Protographs
- (2015) David G. M. Mitchell et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Spatial Coupling of Generator Matrices: A General Approach to Design Good Codes at a Target BER
- (2014) Chulong Liang et al. IEEE TRANSACTIONS ON COMMUNICATIONS
- Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
- (2013) Shrinivas Kudekar et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Windowed Decoding of Spatially Coupled Codes
- (2012) Aravind R. Iyengar et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes
- (2012) D. G. M. Mitchell et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Deriving Good LDPC Convolutional Codes from LDPC Block Codes
- (2011) A E Pusane et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC
- (2011) Shrinivas Kudekar et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels
- (2011) Aravind R. Iyengar et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Braided Convolutional Codes: A New Class of Turbo-Like Codes
- (2010) Wei Zhang et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Iterative Decoding Threshold Analysis for LDPC Convolutional Codes
- (2010) Michael Lentmaier et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- The Generalized Area Theorem and Some of its Consequences
- (2009) Cyril Measson et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- (2009) Erdal Arikan IEEE TRANSACTIONS ON INFORMATION THEORY
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExplorePublish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn More