On the public citation graph
List Decoding of Arıkan’s PAC Codes
0 signed · 106 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/j.phycom.2019.03.004openalex-snapshot
Efficient error-correcting codes in the short blocklength regime
inferredcites →https://doi.org/10.1109/glocom.2017.8254150openalex-snapshot
Viterbi-Aided Successive-Cancellation Decoding of Polar Codes
inferredcites →https://doi.org/10.1109/isit.2014.6874999openalex-snapshot
Branching MERA codes: A natural extension of classical and quantum polar codes
inferredcites →https://doi.org/10.1109/isit.2017.8006852openalex-snapshot
A randomized construction of polar subcodes
inferredcites →https://doi.org/10.1109/isit.2017.8007000openalex-snapshot
Performance Bounds of Concatenated Polar Coding Schemes
inferredcites →https://doi.org/10.1109/isit.2018.8437503openalex-snapshot
Saddlepoint Approximation of the Error Probability of Binary Hypothesis Testing
inferredcites →https://doi.org/10.1109/isit.2018.8437559openalex-snapshot
A Score Function for Sequential Decoding of Polar Codes
inferredcites →https://doi.org/10.1109/isit.2019.8849269openalex-snapshot
Recursive projection-aggregation decoding of Reed-Muller codes
inferredcites →https://doi.org/10.1109/isit.2019.8849445openalex-snapshot
Reduced complexity window processing of binary polarization kernels
inferredcites →https://doi.org/10.1109/isit.2019.8849672openalex-snapshot
On Construction of Polar Subcodes with Large Kernels
inferredcites →https://doi.org/10.1109/isit.2019.8849741openalex-snapshot
Explicit Polar Codes with Small Scaling Exponent
inferredcites →https://doi.org/10.1109/isit.2019.8849752openalex-snapshot
Convolutional Decoding of Polar Codes
inferredcites →https://doi.org/10.1109/isit44484.2020.9174118openalex-snapshot
List Decoding of Arıkan’s PAC Codes
inferredcites →https://doi.org/10.1109/isit44484.2020.9174226openalex-snapshot
Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes
inferredcites →https://doi.org/10.1109/isit45174.2021.9517950openalex-snapshot
A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes
inferredcites →https://doi.org/10.1109/itw.2013.6691213openalex-snapshot
Polar codes with dynamic frozen symbols and their decoding by directed search
inferredcites →https://doi.org/10.1109/itw.2018.8613307openalex-snapshot
Efficient decoding of polar codes with some 16×16 kernels
inferredcites →https://doi.org/10.1109/itw44776.2019.8989386openalex-snapshot
Trellis-based Decoding Techniques for Polar Codes with Large Kernels
inferredcites →https://doi.org/10.1109/jsac.2015.2504299openalex-snapshot
Fast List Decoders for Polar Codes
inferredcites →https://doi.org/10.1109/lcomm.2012.090312.121501openalex-snapshot
CRC-Aided Decoding of Polar Codes
inferredcites →https://doi.org/10.1109/lcomm.2012.111612.121898openalex-snapshot
An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check
inferredcites →https://doi.org/10.1109/lcomm.2014.2323237openalex-snapshot
Sequential Decoding of Polar Codes
inferredcites →https://doi.org/10.1109/lcomm.2020.2984382openalex-snapshot
Design of BCH Polarization Kernels With Reduced Processing Complexity
inferredcites →https://doi.org/10.1109/lcomm.2021.3069668openalex-snapshot
On Systematic Polarization-Adjusted Convolutional (PAC) Codes
inferredcites →https://doi.org/10.1109/lwc.2019.2898195openalex-snapshot
Successive and Two-Stage Systematic Encoding of Polar Subcodes
inferredcites →https://doi.org/10.1109/sips.2014.6986089openalex-snapshot
Increasing the speed of polar list decoders
inferredcites →https://doi.org/10.1109/tcomm.2014.2345069openalex-snapshot
From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance
inferredcites →https://doi.org/10.1109/tcomm.2019.2909213openalex-snapshot
On Distance Properties of Convolutional Polar Codes
inferredcites →https://doi.org/10.1109/tcomm.2020.3014946openalex-snapshot
Design of Short Polar Codes for SCL Decoding
inferredcites →https://doi.org/10.1109/tcomm.2020.3018781openalex-snapshot
Randomized Polar Subcodes With Optimized Error Coefficient
inferredcites →https://doi.org/10.1109/tcomm.2020.3026103openalex-snapshot
Convolutional Polar Kernels
inferredcites →https://doi.org/10.1109/tit.1963.1057827openalex-snapshot
A heuristic discussion of probabilistic decoding
inferredcites →https://doi.org/10.1109/tit.1971.1054678openalex-snapshot
Weight distribution of (128, 64) Reed-Muller code (Corresp.)
inferredcites →https://doi.org/10.1109/tit.2009.2021379openalex-snapshot
Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
inferredcites →https://doi.org/10.1109/tit.2010.2043769openalex-snapshot
Channel Coding Rate in the Finite Blocklength Regime
inferredcites →https://doi.org/10.1109/tit.2010.2080990openalex-snapshot
Polar Codes: Characterization of Exponent, Bounds, and Constructions
inferredcites →https://doi.org/10.1109/tit.2015.2410251openalex-snapshot
List Decoding of Polar Codes
inferredcites →https://doi.org/10.1109/tit.2016.2616900openalex-snapshot
Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations
inferredcites →https://doi.org/10.1109/tit.2020.3038806openalex-snapshot
Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels
inferredcites →https://doi.org/10.1109/tvt.2021.3052550openalex-snapshot
Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding
inferredcites →https://doi.org/10.1109/tvt.2021.3059370openalex-snapshot
List Viterbi Decoding of PAC Codes
inferredcites →https://doi.org/10.1117/12.2585359openalex-snapshot
Genetic optimization of short block-length PAC codes for high capacity PHz communications
inferredcites →https://doi.org/10.1561/0100000009openalex-snapshot
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial
inferredcites →https://doi.org/10.3390/e22111301openalex-snapshot
Systematic Encoding and Shortening of PAC Codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.5855openalex-snapshot
Advanced channel coding schemes for B5G/6G networks: State‐of‐the‐art analysis, research challenges and future directions
inferred← citeshttps://doi.org/10.1016/j.phycom.2024.102578openalex-snapshot
A Monte-Carlo based construction of polarization-adjusted convolutional (PAC) codes
inferred← citeshttps://doi.org/10.1049/cmu2.12587openalex-snapshot
Fast list decoders for polarization‐adjusted convolutional (PAC) codes
inferred← citeshttps://doi.org/10.1049/cmu2.12829openalex-snapshot
A path splitting and pruning strategy on list decoder for PAC codes
inferred← citeshttps://doi.org/10.1109/access.2023.3333039openalex-snapshot
Enhancing Biometric Speaker Recognition Through MFCC Feature Extraction and Polar Codes for Remote Application
inferred← citeshttps://doi.org/10.1109/bmsb65076.2025.11165584openalex-snapshot
Performance Evaluation of PAC Decoding with Deep Neural Networks
inferred← citeshttps://doi.org/10.1109/gcwkshp64532.2024.11101245openalex-snapshot
Polarization-Adjusted Convolutional (PAC) Lattices: Construction and Gaussian Shaping
inferred← citeshttps://doi.org/10.1109/globecom59602.2025.11432289openalex-snapshot
Construction of PAC Codes Based on the Impulse Response of the Convolutional Encoder
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517940openalex-snapshot
List Decoding of Polar Codes: How Large Should the List Be to Achieve ML Decoding?
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834587openalex-snapshot
Approximate Weight Distribution of Polarization-Adjusted Convolutional (PAC) Codes
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619144openalex-snapshot
Sparsely Pre-Transformed Polar Codes for Low-Complexity SCL Decoding
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619251openalex-snapshot
Successive Cancellation Sampling Decoder: An Attempt to Analyze List Decoding Theoretically
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195375openalex-snapshot
PAC Codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195547openalex-snapshot
Low-Complexity PSCL Decoding of Polar Codes
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195561openalex-snapshot
On Fast SC-Based Polar Decoders: Metric Polarization and a Pruning Technique
inferred← citeshttps://doi.org/10.1109/itw62417.2025.11240368openalex-snapshot
PAC Codes Meet CRC-Polar Codes
inferred← citeshttps://doi.org/10.1109/iwsda67899.2025.11457403openalex-snapshot
Backward Fano Decoding for PAC Codes
inferred← citeshttps://doi.org/10.1109/jiot.2025.3644479openalex-snapshot
Energy-Efficient RIS-Aided Coded Cooperation System by PAC Codes: Design and Performance Analysis
inferred← citeshttps://doi.org/10.1109/jsac.2025.3531569openalex-snapshot
Block Orthogonal Sparse Superposition Codes for L 3 Communications: Low Error Rate, Low Latency, and Low Transmission Power
inferred← citeshttps://doi.org/10.1109/jsait.2023.3338326openalex-snapshot
Dimensions of Channel Coding: From Theory to Algorithms to Applications
inferred← citeshttps://doi.org/10.1109/lcomm.2022.3209082openalex-snapshot
A Weighted Sum Based Construction of PAC Codes
inferred← citeshttps://doi.org/10.1109/lcomm.2024.3354490openalex-snapshot
Fast List Decoding of PAC Codes With New Nodes
inferred← citeshttps://doi.org/10.1109/lcomm.2025.3559466openalex-snapshot
Enhancing Belief Propagation Decoding of Polar Codes: A Reinforcement Learning Approach
inferred← citeshttps://doi.org/10.1109/lcomm.2026.3683509openalex-snapshot
Fast Partial-Sum Update Method for Successive-Cancellation Decoding of Polar Codes and PAC Codes
inferred← citeshttps://doi.org/10.1109/les.2024.3417413openalex-snapshot
Software Implementation of Fast List Decoder for PAC Codes
inferred← citeshttps://doi.org/10.1109/lwc.2025.3551288openalex-snapshot
Neural Network Aided Low-Complexity Decoding for PAC Codes
inferred← citeshttps://doi.org/10.1109/ojcoms.2024.3390000openalex-snapshot
Channel Coding Toward 6G: Technical Overview and Outlook
inferred← citeshttps://doi.org/10.1109/ojcoms.2024.3447042openalex-snapshot
On Improving the Design of Parity-Check Polar Codes
inferred← citeshttps://doi.org/10.1109/ojcoms.2025.3644338openalex-snapshot
Reverse Convolutional Precoding of Polar Codes: Design, Analysis, and Decoding Algorithms
inferred← citeshttps://doi.org/10.1109/spcom50965.2020.9179593openalex-snapshot
Bounds on the List Size of Successive Cancellation List Decoding
inferred← citeshttps://doi.org/10.1109/tbc.2025.3534624openalex-snapshot
Simplified Fast List PAC Decoder for Broadcasting Services in 6G: Algorithm and Implementation
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3255254openalex-snapshot
A Tree Pruning Technique for Decoding Complexity Reduction of Polar Codes and PAC Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3305523openalex-snapshot
Scalable Polar Code Construction for Successive Cancellation List Decoding: A Graph Neural Network-Based Approach
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3317912openalex-snapshot
Block Orthogonal Sparse Superposition Codes for Ultra-Reliable Low-Latency Communications
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3320699openalex-snapshot
A New Joint Source-Channel Coding for Short-Packet Communications
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3364989openalex-snapshot
Successive Cancellation Ordered Search Decoding of Modified G N -Coset Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2025.3548032openalex-snapshot
Low-Complexity PSCL Decoding of Polar Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2025.3578803openalex-snapshot
Tail-Biting Convolutional Codes for URLLC: Low-Complexity List Decoding and Rate-Compatible Construction
inferred← citeshttps://doi.org/10.1109/tcomm.2025.3608300openalex-snapshot
A New Metric Function for SC-Based Polar Decoders: Polarization, Pruning, and Fast Decoders
inferred← citeshttps://doi.org/10.1109/tcomm.2026.3658354openalex-snapshot
Polarized Element-Pair Code-Based FFMA Over a Gaussian Multiple-Access Channel
inferred← citeshttps://doi.org/10.1109/tcomm.2026.3706481openalex-snapshot
A Low-Complexity Parallel Hybrid Decoder for Primitive Rateless Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2026.3731769openalex-snapshot
Multi-Rate CRC-Aided TBCC via Bit Repetition: Construction and Decoding
inferred← citeshttps://doi.org/10.1109/tcsii.2021.3123270openalex-snapshot
Hardware Implementation of Fano Decoder for Polarization-Adjusted Convolutional (PAC) Codes
inferred← citeshttps://doi.org/10.1109/tit.2022.3173152openalex-snapshot
An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design
inferred← citeshttps://doi.org/10.1109/tit.2023.3243191openalex-snapshot
A Deterministic Algorithm for Computing the Weight Distribution of Polar Code
inferred← citeshttps://doi.org/10.1109/tit.2025.3608563openalex-snapshot
PAC Codes With Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
inferred← citeshttps://doi.org/10.1109/tmag.2022.3213584openalex-snapshot
Multidimensional Signal Processing for High Areal Density Heated-Dot Magnetic Recording
inferred← citeshttps://doi.org/10.1109/tmag.2024.3505272openalex-snapshot
Enhanced Multidimensional Signal Processing Schemes for High Areal Density Heated-Dot Magnetic Recording
inferred← citeshttps://doi.org/10.1109/tmag.2025.3609716openalex-snapshot
Efficient Multidimensional Signal Processing Schemes for Heated-Dot Magnetic Recording With Multi-Layered Bit-Patterned Media
inferred← citeshttps://doi.org/10.1109/wcnc51071.2022.9771578openalex-snapshot
A Modified Q-Learning Algorithm for Rate-Profiling of Polarization Adjusted Convolutional (PAC) Codes
inferred← citeshttps://doi.org/10.1109/wcnc65185.2026.11555507openalex-snapshot
Bit-Flip Fano Sequential Decoding of Polarization-Adjusted Convolutional (PAC) Codes
inferred← citeshttps://doi.org/10.30748/soi.2024.179.10openalex-snapshot
ДЕКОДУВАННЯ АЛГЕБРАЇЧНИХ ЗГОРТКОВИХ КОДІВ ЗА ВПОРЯДКОВАНИМИ СТАТИСТИКАМИ
inferred← citeshttps://doi.org/10.32628/cseit24103116openalex-snapshot
Optimizing Speaker Recognition in Complex Environments : An Enhanced Framework with Artificial Neural Networks for Multi-Speaker Settings
inferred← citeshttps://doi.org/10.3390/e25111498openalex-snapshot
A Note on the Mixing Factor of Polar Codes
inferred← citeshttps://doi.org/10.46904/eea.23.71.2.1108007openalex-snapshot
Fast Polarization-Adjusted Convolutional (PAC) Software Decoders: Algorithm and Implementation
inferred← citeshttps://doi.org/10.48550/arxiv.2011.04930openalex-snapshot
Selectively Precoded Polar Codes
inferred← citeshttps://doi.org/10.48550/arxiv.2012.04990openalex-snapshot
Performance and Complexity of Sequential Decoding of PAC Codes
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.