Keyword

decoding complexity

Description: Decoding complexity is the computational effort or resources required to recover encoded information in coding and communication systems.

Primary topic: Error Correcting Code Techniques (49%)

OpenAlex ID: keywords/decoding-complexity

Overview of the Scalable Video Coding Extension of the H.264/AVC Standard

2007 · H. Schwarz, D. Marpe, et al. · IEEE Transactions on Circuits and Systems for Video Technology · 3,533

Error Detecting and Error Correcting Codes

2014 · Neha Chauhan, Pooja Yadav, et al. · 3,202

A recursive approach to low complexity codes

1981 · R. Tanner · IEEE Transactions on Information Theory · 3,142

List Decoding of Polar Codes

2015 · Ido Tal, Alexander Vardy · IEEE Transactions on Information Theory · 1,824

High-rate codes that are linear in space and time

2002 · B. Hassibi, B.M. Hochwald · IEEE Transactions on Information Theory · 1,342

Turbo decoding as an instance of Pearl's "belief propagation" algorithm

1998 · R.J. McEliece, D.J.C. MacKay, et al. · IEEE Journal on Selected Areas in Communications · 905

CRC-Aided Decoding of Polar Codes

2012 · Kai Niu, Kai Chen · IEEE Communications Letters · 904

Codes and Decoding on General Graphs

1996 · N. Wiberg · 898

Video coding with H.264/AVC: tools, performance, and complexity

2004 · J. Ostermann, J. Bormans, et al. · IEEE Circuits and Systems Magazine · 895

HEVC Complexity and Implementation Analysis

2012 · Frank Bossen, Benjamin Bross, et al. · IEEE Transactions on Circuits and Systems for Video Technology · 760

Time-varying periodic convolutional codes with low-density parity-check matrix

1999 · A. Jimenez Felstrom, K.S. Zigangirov · IEEE Transactions on Information Theory · 759

Lattice code decoder for space-time codes

2000 · O. Damen, A. Chkeif, et al. · IEEE Communications Letters · 757

A Rank-Metric Approach to Error Control in Random Network Coding

2008 · Danilo Silva, Frank R. Kschischang, et al. · IEEE Transactions on Information Theory · 670

PDF

Coset codes. I. Introduction and geometrical classification

1988 · G.D. Forney · IEEE Transactions on Information Theory · 626

A coding scheme for additive noise channels with feedback--I: No bandwidth constraint

1966 · J. Schalkwijk, T. Kailath · IEEE Transactions on Information Theory · 587

On deep learning-based channel decoding

2017 · Tobias Gruber, Sebastian Cammerer, et al. · Conference on Information Sciences and Systems · 573

Fast Sequential Decoding Algorithm Using a Stack

1969 · F. Jelinek · IBM Journal of Research and Development · 541

List decoding of polar codes

2011 · Ido Tal, Alexander Vardy · IEEE International Symposium on Information Theory (ISIT) · 538

Viterbi Decoding for Satellite and Space Communication

1971 · J. Heller, I. Jacobs · IEEE Transactions on Communication Technology · 414

Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding

2012 · Anja Becker, Antoine Joux, et al. · Lecture notes in computer science · 401

Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes

1964 · R. Chien · IEEE Transactions on Information Theory · 401

Improving Frame Interpolation With Spatial Motion Smoothing for Pixel Domain Distributed Video Coding

2005 · João Ascenso, Catarina Brites, et al. · 383

An Overview of Core Coding Tools in the AV1 Video Codec

2018 · Yue Chen, Debargha Murherjee, et al. · Picture Coding Symposium · 373

Minimal vectors in linear codes

1998 · A. Ashikhmin, A. Barg · IEEE Transactions on Information Theory · 348

Linear constellation precoding for OFDM with maximum multipath diversity and coding gains

2003 · Zhiqiang Liu, Yan Xin, et al. · IEEE Transactions on Communications · 341

Works count: 5,165

Citation count: 68,570