On the public citation graph

A Split-Reduced Successive Cancellation List Decoder for Polar Codes

https://doi.org/10.1109/jsac.2015.2504321

0 signed · 94 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-349-13012-2_24openalex-snapshot

Digital communications

inferredcites →https://doi.org/10.1049/el.2011.3334openalex-snapshot

List successive cancellation decoding of polar codes

inferredcites →https://doi.org/10.1049/el.2012.1459openalex-snapshot

Stack decoding of polar codes

inferredcites →https://doi.org/10.1109/18.910578openalex-snapshot

Design of capacity-approaching irregular low-density parity-check codes

inferredcites →https://doi.org/10.1109/18.910580openalex-snapshot

Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

inferredcites →https://doi.org/10.1109/acssc.2014.7094848openalex-snapshot

A low-complexity improved successive cancellation decoder for polar codes

inferredcites →https://doi.org/10.1109/isit.2010.5513585openalex-snapshot

On the scaling of polar codes: II. The behavior of un-polarized channels

inferredcites →https://doi.org/10.1109/isit.2010.5513586openalex-snapshot

On the scaling of polar codes: I. The behavior of polarized channels

inferredcites →https://doi.org/10.1109/isit.2011.6033904openalex-snapshot

List decoding of polar codes

inferredcites →https://doi.org/10.1109/lcomm.2011.101811.111480openalex-snapshot

A Simplified Successive-Cancellation Decoder for 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.2014.2325811openalex-snapshot

Construction and Block Error Rate Analysis of Polar Codes Over AWGN Channel Based on Gaussian Approximation

inferredcites →https://doi.org/10.1109/tcomm.2012.081512.110872openalex-snapshot

Efficient Design and Decoding of Polar Codes

inferredcites →https://doi.org/10.1109/tcomm.2013.070213.120789openalex-snapshot

Improved Successive Cancellation Decoding of Polar Codes

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.2013.2272694openalex-snapshot

How to Construct Polar Codes

inferredcites →https://doi.org/10.1109/tit.2015.2410251openalex-snapshot

List Decoding of Polar Codes

inferredcites →https://doi.org/10.4324/9780080477527-64openalex-snapshot

Digital communications

inferredcites →https://doi.org/10.48550/arxiv.1001.2766openalex-snapshot

On the scaling of Polar codes: I. The behavior of polarized channels

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4141260openalex-extracted

Improved Decoding Algorithms Based on Successive Cancellation for Polar Codes with Multiple Crcs

inferred← citeshttps://doi.org/10.1007/978-3-030-41114-5_24openalex-snapshot

Improved Incremental Freezing HARQ Schemes Using Polar Codes over Degraded Compound Channels

inferred← citeshttps://doi.org/10.1007/978-981-95-1810-4_1openalex-snapshot

Introduction to Mobile Communications

inferred← citeshttps://doi.org/10.1007/978-981-97-1332-5_15openalex-snapshot

Research on Physical Layer of Passive IoT Communication Protocol Based on Cellular Fusion

inferred← citeshttps://doi.org/10.1007/s11227-018-2519-yopenalex-snapshot

A novel semi-folded parallel successive cancellation-based polar decoder for optimal-register allocation

inferred← citeshttps://doi.org/10.1007/s11277-022-09688-wopenalex-snapshot

Multi-objective Optimization with FEC Polar Code for Bandwidth Efficient Mobile Network Using Response Surface Methodology

inferred← citeshttps://doi.org/10.1007/s11431-020-1630-2openalex-snapshot

How to apply polar codes in high throughput space communications

inferred← citeshttps://doi.org/10.1007/s11432-017-9128-xopenalex-snapshot

A complexity-reduced fast successive cancellation list decoder for polar codes

inferred← citeshttps://doi.org/10.1007/s11432-019-2924-6openalex-snapshot

Efficient stochastic successive cancellation list decoder for polar codes

inferred← citeshttps://doi.org/10.1007/s12243-025-01111-2openalex-snapshot

A low-complexity successive cancellation list decoding for polar codes with variable thresholds

inferred← citeshttps://doi.org/10.1016/j.comcom.2018.02.013openalex-snapshot

Polar codes with the unequal error protection property

inferred← citeshttps://doi.org/10.1049/cmu2.12153openalex-snapshot

An improved path splitting strategy on successive cancellation list decoder for polar 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.1049/iet-com.2018.5643openalex-snapshot

Complexity‐adjustable SC decoding of polar codes for energy consumption reduction

inferred← citeshttps://doi.org/10.1109/access.2018.2886464openalex-snapshot

A Flip-Syndrome-List Polar Decoder Architecture for Ultra-Low-Latency Communications

inferred← citeshttps://doi.org/10.1109/access.2019.2901596openalex-snapshot

CRC-Aided Logarithmic Stack Decoding of Polar Codes for Ultra Reliable Low Latency Communication in 3GPP New Radio

inferred← citeshttps://doi.org/10.1109/access.2019.2922664openalex-snapshot

Generalized Segmented Bit-Flipping Scheme for Successive Cancellation Decoding of Polar Codes With Cyclic Redundancy Check

inferred← citeshttps://doi.org/10.1109/access.2020.2985909openalex-snapshot

An Area-Efficient Hybrid Polar Decoder With Pipelined Architecture

inferred← citeshttps://doi.org/10.1109/access.2020.3044877openalex-snapshot

An Adaptive Ordered Shifted-Pruning List Decoder for Polar Codes

inferred← citeshttps://doi.org/10.1109/access.2022.3199000openalex-snapshot

In Situ Multi-Bit Decision for Successive Cancellation List Decoding of Polar Codes

inferred← citeshttps://doi.org/10.1109/aparm49247.2020.9209430openalex-snapshot

A Segmented CRC-Aided PSS-SS-SCL Algorithm for Polar Codes

inferred← citeshttps://doi.org/10.1109/asicon47005.2019.8983650openalex-snapshot

Flexible and Adaptive Path Splitting of Simplified Successive Cancellation List Polar Decoding

inferred← citeshttps://doi.org/10.1109/atc50776.2020.9255435openalex-snapshot

Design of Partition Decoding for Polar Codes in 5G New Radio

inferred← citeshttps://doi.org/10.1109/compcomm.2018.8780858openalex-snapshot

A Low-Complexity Improved Progressive Bit-Flipping Decoding for Polar Codes

inferred← citeshttps://doi.org/10.1109/comst.2019.2937923openalex-snapshot

Polar Codes and Their Quantum-Domain Counterparts

inferred← citeshttps://doi.org/10.1109/glocom.2016.7841969openalex-snapshot

Low-Complexity List Successive-Cancellation Decoding of Polar Codes Using List Pruning

inferred← citeshttps://doi.org/10.1109/glocom.2017.8254937openalex-snapshot

Irregular Polar Coding for Massive MIMO Channels

inferred← citeshttps://doi.org/10.1109/icassp40776.2020.9054155openalex-snapshot

A Low-Latency Successive Cancellation Hybrid Decoder for Convolutional Polar Codes

inferred← citeshttps://doi.org/10.1109/icc40277.2020.9149340openalex-snapshot

Threshold-Based Successive-Cancellation Decoding of Polar Codes

inferred← citeshttps://doi.org/10.1109/iccc49849.2020.9238903openalex-snapshot

A Low Complexity Successive Cancellation List Decoding Algorithm of Polar Codes

inferred← citeshttps://doi.org/10.1109/iccchina.2018.8641216openalex-snapshot

List Estimation-aided Successive-Cancellation List Decoding of Polar Codes

inferred← citeshttps://doi.org/10.1109/iccchina.2019.8855853openalex-snapshot

An LLR-Based Segmented Flipped SCL Decoding Algorithm for Polar Codes

inferred← citeshttps://doi.org/10.1109/icccworkshops57813.2023.10233707openalex-snapshot

Reduced Complexity SCL Decoding of U-UV Codes Through List Pruning

inferred← citeshttps://doi.org/10.1109/iccsp.2017.8286701openalex-snapshot

A review on resource efficient polar decoders-present and past

inferred← citeshttps://doi.org/10.1109/icct52962.2021.9658042openalex-snapshot

Threshold-Based List Decoding for PAC Codes

inferred← citeshttps://doi.org/10.1109/icece48499.2019.9058544openalex-snapshot

A New Polar Code SCF Method Based on Effective Flip Bits

inferred← citeshttps://doi.org/10.1109/ieee-iws.2019.8804046openalex-snapshot

A CRC-Aided SR-SCL Decoding Algorithm for Polar Codes

inferred← citeshttps://doi.org/10.1109/iscas51556.2021.9401175openalex-snapshot

Adaptive Successive Cancellation Priority Decoder for 5G Polar Codes

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/isit63088.2025.11195489openalex-snapshot

Perturbation-Based Decoding Schemes for Long Polar Codes

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/ismvl68998.2026.00034openalex-snapshot

Improved Ising Model Formulation for Polar Codes

inferred← citeshttps://doi.org/10.1109/istc.2018.8625267openalex-snapshot

Stepped List Decoding for Polar Codes

inferred← citeshttps://doi.org/10.1109/istc49272.2021.9594266openalex-snapshot

Tailored List Decoding of Polar Codes

inferred← citeshttps://doi.org/10.1109/jsac.2024.3431579openalex-snapshot

Decoding of Polar Codes Using Quadratic Unconstrained Binary Optimization

inferred← citeshttps://doi.org/10.1109/lcomm.2018.2875437openalex-snapshot

A Low-Latency Simplified Successive Cancellation Decoder for Polar Codes Based on Node Error Probability

inferred← citeshttps://doi.org/10.1109/lcomm.2021.3109795openalex-snapshot

An Improved Path Splitting Decision-Aided SCL Decoding Algorithm for Polar Codes

inferred← citeshttps://doi.org/10.1109/lcomm.2025.3561246openalex-snapshot

Multi-Bit Successive Cancellation List Decoding of Polar Codes Using One-Bit Error Boundary

inferred← citeshttps://doi.org/10.1109/lcomm.2026.3702695openalex-snapshot

Polar Decoding Tree Pruning Based on Soft-Output Extraction

inferred← citeshttps://doi.org/10.1109/lwc.2021.3129470openalex-snapshot

Dynamic SCL Decoder With Path-Flipping for 5G Polar Codes

inferred← citeshttps://doi.org/10.1109/lwc.2026.3716535openalex-snapshot

RV-QUBO: Reduced-Variable QUBO for Decoding Short Systematic Polar Codes

inferred← citeshttps://doi.org/10.1109/softt56880.2022.10009940openalex-snapshot

Parallel Single Parity Check Nodes for High-Throughput Fast-SSCL Polar Code Decoders

inferred← citeshttps://doi.org/10.1109/tcomm.2021.3064964openalex-snapshot

Threshold-Based Fast Successive-Cancellation Decoding of Polar 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.3608300openalex-snapshot

A New Metric Function for SC-Based Polar Decoders: Polarization, Pruning, and Fast Decoders

inferred← citeshttps://doi.org/10.1109/tgcn.2025.3532093openalex-snapshot

GenAlg-SCL: Genetic Algorithm-Based SCL Polar Decoding Toward List Size Optimization

inferred← citeshttps://doi.org/10.1109/tsp.2018.2838554openalex-snapshot

A High-Throughput Architecture of List Successive Cancellation Polar Codes Decoder With Large List Size

inferred← citeshttps://doi.org/10.1109/tsp.2018.2839586openalex-snapshot

Efficient Partial-Sum Network Architectures for List Successive-Cancellation Decoding of Polar Codes

inferred← citeshttps://doi.org/10.1109/tsp.2020.3029389openalex-snapshot

A Node-Reliability Based CRC-Aided Successive Cancellation List Polar Decoder Architecture Combined With Post-Processing

inferred← citeshttps://doi.org/10.1109/tsp.2022.3150962openalex-snapshot

Fast Iterative Soft-Output List Decoding of Polar Codes

inferred← citeshttps://doi.org/10.1109/tvt.2020.2973552openalex-snapshot

Low-Latency Segmented List-Pruning Software Polar List Decoder

inferred← citeshttps://doi.org/10.1109/tvt.2022.3166546openalex-snapshot

Significance-Test Based Blind Detection for 5G

inferred← citeshttps://doi.org/10.1109/wcnc49053.2021.9417534openalex-snapshot

Deletion Error Correction based on Polar Codes in Skyrmion Racetrack Memory

inferred← citeshttps://doi.org/10.1109/wocc.2019.8770559openalex-snapshot

Modified Successive Cancellation Flip Decoder for Polar Codes Based on Gaussian Approximation

inferred← citeshttps://doi.org/10.1109/wts53620.2022.9768320openalex-snapshot

Simplified Path Split Strategy for SCL Decoding Algorithm with Lower Latency

inferred← citeshttps://doi.org/10.1145/3456415.3456439openalex-snapshot

A Progressive PSS-SS-SCL Algorithm for Polar Codes

inferred← citeshttps://doi.org/10.23919/jcc.2023.02.015openalex-snapshot

A golden decade of polar codes: From basic principle to 5G applications

inferred← citeshttps://doi.org/10.3390/e19040183openalex-snapshot

Low Complexity List Decoding for Polar Codes with Multiple CRC Codes

inferred← citeshttps://doi.org/10.3390/e24121806openalex-snapshot

Adaptive List Flip Decoder for Polar Codes with High-Order Error Correction Capability and a Simplified Flip Metric

inferred← citeshttps://doi.org/10.3390/electronics11040560openalex-snapshot

Partial Order-Based Decoding of Rate-1 Nodes in Fast Simplified Successive-Cancellation List Decoders for Polar Codes

inferred← citeshttps://doi.org/10.3390/math11214462openalex-snapshot

An Improved Bit-Flipping Algorithm of Successive Cancellation List Decoding for Polar Codes

inferred← citeshttps://doi.org/10.3390/math12182937openalex-snapshot

Shift Pruning-Based SCL Decoding for Polar Codes

inferred← citeshttps://doi.org/10.48550/arxiv.1610.07297openalex-snapshot

Channel capacity of polar coding with a given polar mismatched successive cancellation decoder

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.