On the public citation graph
A Connection Between Block and Convolutional Codes
0 signed · 181 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/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/tcom.1971.1090700openalex-snapshot
Convolutional Codes and Their Performance in Communication Systems
inferredcites →https://doi.org/10.1109/tit.1965.1053723openalex-snapshot
Some properties of binary convolutional code generators
inferredcites →https://doi.org/10.1109/tit.1969.1054375openalex-snapshot
Further results on optimal decoding of convolutional codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1970.1054541openalex-snapshot
Convolutional codes I: Algebraic structure
inferredcites →https://doi.org/10.1137/0109055openalex-snapshot
A New Treatment of Bose-Chaudhuri 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/0471219282.eot366openalex-snapshot
Tailbiting Convolutional Codes
inferred← citeshttps://doi.org/10.1007/1-4020-8084-0_5openalex-snapshot
Trellis representation of codes
inferred← citeshttps://doi.org/10.1007/3-540-44828-4_26openalex-snapshot
Quasicyclic Codes of Index ℓ over F q Viewed as F q[x]-Submodules of F q ℓ[x]/〈x m−1〉
inferred← citeshttps://doi.org/10.1007/3-540-46796-3_19openalex-snapshot
Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping
inferred← citeshttps://doi.org/10.1007/978-1-4613-0165-3_12openalex-snapshot
Properties of the Tailbiting BCJR Decoder
inferred← citeshttps://doi.org/10.1007/978-1-4615-5121-8_11openalex-snapshot
Classification of Certain Tail-Biting Generators for the Binary Golay Code
inferred← citeshttps://doi.org/10.1007/978-1-4615-5745-6openalex-snapshot
Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-01727-3_3openalex-snapshot
Generator Matrix Approach to s.s. Time-Invariant Convolutional Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-01727-3_4openalex-snapshot
Wide-Sense Time-Invariant Convolutional Codes in Their Generator Matrix
inferred← citeshttps://doi.org/10.1007/978-3-540-30542-2_83openalex-snapshot
Performance Analysis for Serially Concatenated FEC in IEEE802.16a over Wireless Channels
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_29openalex-snapshot
A Short Introduction to Cyclic Convolutional Codes
inferred← citeshttps://doi.org/10.1007/978-981-19-0920-7openalex-snapshot
Modern Cryptography Volume 1
inferred← citeshttps://doi.org/10.1007/bf01270398openalex-snapshot
Structural properties and enumeration of quasi cyclic codes
inferred← citeshttps://doi.org/10.1007/s00200-003-0117-5openalex-snapshot
DFT Domain Characterization of Quasi-Cyclic Codes
inferred← citeshttps://doi.org/10.1007/s00200-009-0095-3openalex-snapshot
Generalized quasi-cyclic codes: structural properties and code construction
inferred← citeshttps://doi.org/10.1007/s00200-026-00728-7openalex-snapshot
A convolutional mask for the McEliece cryptosystem with binary Goppa codes
inferred← citeshttps://doi.org/10.1007/s10623-010-9417-5openalex-snapshot
Structural properties and enumeration of 1-generator generalized quasi-cyclic codes
inferred← citeshttps://doi.org/10.1007/s10623-011-9586-xopenalex-snapshot
Constructing quasi-cyclic codes from linear algebra theory
inferred← citeshttps://doi.org/10.1007/s10623-024-01532-5openalex-snapshot
A construction of optimal quasi-cyclic locally recoverable codes using constituent codes
inferred← citeshttps://doi.org/10.1007/s10623-025-01761-2openalex-snapshot
A tight upper bound on the number of nonzero weights of a quasi-cyclic code
inferred← citeshttps://doi.org/10.1016/0893-9659(95)00049-vopenalex-snapshot
A (105,10,47) binary quasi-cyclic code
inferred← citeshttps://doi.org/10.1016/j.dam.2008.01.013openalex-snapshot
On quintic quasi-cyclic codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2018.01.012openalex-snapshot
Multi-twisted codes over finite fields and their dual codes
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.06.180openalex-snapshot
State Realizations of 2-Periodic Convolutional Codes: a switching system approach
inferred← citeshttps://doi.org/10.1016/j.mejo.2013.02.023openalex-snapshot
A fast LDPC encoder/decoder for small/medium codes
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00126-2openalex-snapshot
New minimum distance bounds for linear codes over GF(5)
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00350-4openalex-snapshot
Algebraic structure of quasicyclic codes
inferred← citeshttps://doi.org/10.1017/cbo9780511800467openalex-snapshot
Algebraic Codes for Data Transmission
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.006openalex-snapshot
The Arithmetic of Galois Fields
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.008openalex-snapshot
Codes Based on the Fourier Transform
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.009openalex-snapshot
Algorithms Based on the Fourier Transform
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.013openalex-snapshot
Codes and Algorithms Based on Graphs
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.014openalex-snapshot
Performance of Error-Control Codes
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.015openalex-snapshot
Codes and Algorithms for Majority Decoding
inferred← citeshttps://doi.org/10.1023/a:1020042222802openalex-snapshot
Encoder and Distance Properties of Woven Convolutional Codes with One Tailbiting Component Code
inferred← citeshttps://doi.org/10.1023/a:1020046323711openalex-snapshot
A Note on Systematic Tailbiting Encoders
inferred← citeshttps://doi.org/10.1023/a:1020094206873openalex-snapshot
New One-Generator Quasi-cyclic Codes over GF(7)
inferred← citeshttps://doi.org/10.1023/a:1020387017352openalex-snapshot
Distance Approach to Window Decoding
inferred← citeshttps://doi.org/10.1023/a:1022097828917openalex-snapshot
A Distance Measure Tailored to Tailbiting Codes
inferred← citeshttps://doi.org/10.1023/a:1024715527805openalex-snapshot
On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings
inferred← citeshttps://doi.org/10.1023/a:1025100305167openalex-snapshot
New Quasi-cyclic Degenerate Linear Codes over GF(8)
inferred← citeshttps://doi.org/10.1023/b:prit.0000024876.30498.f4openalex-snapshot
New Minimum Distance Bounds for Linear Codes over GF(9)
inferred← citeshttps://doi.org/10.1088/1742-6596/1684/1/012089openalex-snapshot
On normalized generating sets for generalized quasi-twisted codes over finite fields
inferred← citeshttps://doi.org/10.1090/conm/642/12886openalex-snapshot
Equivalence Classes and Structures of Constacyclic Codes Over Finite Fields
inferred← citeshttps://doi.org/10.1098/rspa.1994.0149openalex-snapshot
New properties of convolutional codes and some applications to communication systems
inferred← citeshttps://doi.org/10.1109/18.144719openalex-snapshot
Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
inferred← citeshttps://doi.org/10.1109/18.21246openalex-snapshot
Coset codes. II. Binary lattices and related codes
inferred← citeshttps://doi.org/10.1109/18.259636openalex-snapshot
Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes
inferred← citeshttps://doi.org/10.1109/18.54876openalex-snapshot
Quasi-cyclic unit memory convolutional codes
inferred← citeshttps://doi.org/10.1109/18.57218openalex-snapshot
Application of circulant matrices to the construction and decoding of linear codes
inferred← citeshttps://doi.org/10.1109/18.651076openalex-snapshot
A link between quasi-cyclic codes and convolutional codes
inferred← citeshttps://doi.org/10.1109/18.669296openalex-snapshot
Decoding linear block codes using a priority-first search: performance analysis and suboptimal version
inferred← citeshttps://doi.org/10.1109/18.720549openalex-snapshot
The art of signaling: fifty years of coding theory
inferred← citeshttps://doi.org/10.1109/18.737530openalex-snapshot
Efficient heuristic search algorithms for soft-decision decoding of linear block codes
inferred← citeshttps://doi.org/10.1109/18.771145openalex-snapshot
Minimal tail-biting trellises: the Golay code and more
inferred← citeshttps://doi.org/10.1109/18.782172openalex-snapshot
The Golay convolutional code-some application aspects
inferred← citeshttps://doi.org/10.1109/18.796408openalex-snapshot
Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
inferred← citeshttps://doi.org/10.1109/18.79911openalex-snapshot
Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes
inferred← citeshttps://doi.org/10.1109/18.850685openalex-snapshot
Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes
inferred← citeshttps://doi.org/10.1109/18.904537openalex-snapshot
Code construction and decoding of parallel concatenated tail-biting codes
inferred← citeshttps://doi.org/10.1109/18.915663openalex-snapshot
Graph-based iterative decoding algorithms for parity-concatenated trellis codes
inferred← citeshttps://doi.org/10.1109/18.959257openalex-snapshot
On the algebraic structure of quasi-cyclic codes .I. Finite fields
inferred← citeshttps://doi.org/10.1109/18.971744openalex-snapshot
Tailbiting codes: bounds and search results
inferred← citeshttps://doi.org/10.1109/18.979329openalex-snapshot
A note on tailbiting codes and their feedback encoders
inferred← citeshttps://doi.org/10.1109/25.282266openalex-snapshot
An efficient adaptive circular Viterbi algorithm for decoding generalized tailbiting convolutional codes
inferred← citeshttps://doi.org/10.1109/26.31187openalex-snapshot
An efficient maximum likelihood decoding algorithm for generalized tail biting convolutional codes including quasicyclic codes
inferred← citeshttps://doi.org/10.1109/26.843127openalex-snapshot
Best short rate 1/2 tailbiting codes for the bit-error rate criterion
inferred← citeshttps://doi.org/10.1109/26.975743openalex-snapshot
Iterative Viterbi decoding, trellis shaping, and multilevel structure for high-rate parity-concatenated TCM
inferred← citeshttps://doi.org/10.1109/49.661103openalex-snapshot
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
inferred← citeshttps://doi.org/10.1109/49.661106openalex-snapshot
Symbol-by-symbol MAP decoding algorithm for high-rate convolutional codes that use reciprocal dual codes
inferred← citeshttps://doi.org/10.1109/allerton.2010.5706882openalex-snapshot
Construction of turbo lattices
inferred← citeshttps://doi.org/10.1109/ausctw.2006.1625261openalex-snapshot
Efficient Dual Domain Decoding of High Rate Tail-biting Codes
inferred← citeshttps://doi.org/10.1109/glocom.2001.965971openalex-snapshot
Application of high-rate tail-biting codes to generalized partial response channels
inferred← citeshttps://doi.org/10.1109/glocom.2004.1377939openalex-snapshot
Turbo-like soft-decision decoding of Reed-Solomon codes
inferred← citeshttps://doi.org/10.1109/icassp.2004.1326426openalex-snapshot
Critically subsampled filterbanks implementing Reed-Solomon codes
inferred← citeshttps://doi.org/10.1109/icct.2012.6511359openalex-snapshot
A unified coding scheme for specified channel quality indicator length in LTE physic uplink share channel
inferred← citeshttps://doi.org/10.1109/icupc.1997.625559openalex-snapshot
Soft-decoding of convolutional block codes for an interactive television return channel
inferred← citeshttps://doi.org/10.1109/isit.1994.394956openalex-snapshot
Convolutional encoding of self-dual codes
inferred← citeshttps://doi.org/10.1109/isit.1997.613276openalex-snapshot
Generalized concatenated codes with quasi-cyclic codes as outer code
inferred← citeshttps://doi.org/10.1109/isit.1998.708860openalex-snapshot
Minimal tail-biting trellises: the Golay code and more
inferred← citeshttps://doi.org/10.1109/isit.2000.866407openalex-snapshot
General structure and construction of tail biting trellises for linear block codes
inferred← citeshttps://doi.org/10.1109/isit.2000.866494openalex-snapshot
Algebraic structure of quasicyclic codes
inferred← citeshttps://doi.org/10.1109/isit.2000.866639openalex-snapshot
Searching for tailbiting codes with large minimum distances
inferred← citeshttps://doi.org/10.1109/isit.2000.866640openalex-snapshot
Decoding of codes based on their tailbiting trellises
inferred← citeshttps://doi.org/10.1109/isit.2001.935899openalex-snapshot
DFT domain characterization of quasicyclic codes
inferred← citeshttps://doi.org/10.1109/isit.2001.936153openalex-snapshot
Some distance properties of tailbiting codes
inferred← citeshttps://doi.org/10.1109/isit.2001.936154openalex-snapshot
ML decoding of block codes on their tailbiting trellises
inferred← citeshttps://doi.org/10.1109/isit.2005.1523471openalex-snapshot
Algebraic lower bounds on the free distance convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.2005.1523557openalex-snapshot
Approximate MAP decoding on tail-biting trellises
inferred← citeshttps://doi.org/10.1109/isit.2005.1523776openalex-snapshot
Filterbank decompositions for BCH-codes with applications to soft decoding and code division multiple acces systems
inferred← citeshttps://doi.org/10.1109/isit.2011.6033700openalex-snapshot
Exact free distance and trapping set growth rates for LDPC convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.2013.6620551openalex-snapshot
On the minimum distance of generalized spatially coupled LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.2014.6875301openalex-snapshot
Decoding of quasi-cyclic codes up to a new lower bound on the minimum distance
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174422openalex-snapshot
An Efficient Algorithm for Designing Optimal CRCs for Tail-Biting Convolutional Codes
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653679openalex-snapshot
Lyndon-Word Expurgation and Sphere Decoding of Tail-Biting Convolutional Codes Using BCH Codes
inferred← citeshttps://doi.org/10.1109/issse.1998.738095openalex-snapshot
Turbo decoding with tail-biting trellises
inferred← citeshttps://doi.org/10.1109/istc57237.2023.10273520openalex-snapshot
On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes
inferred← citeshttps://doi.org/10.1109/itw.2005.1531873openalex-snapshot
Soft-in soft-out Reed-Solomon decoding using critically subsampled filterbanks
inferred← citeshttps://doi.org/10.1109/itw.2018.8613507openalex-snapshot
Free Pseudodistance Growth Rates for Spatially Coupled LDPC Codes over the BEC
inferred← citeshttps://doi.org/10.1109/jsac.2009.090802openalex-snapshot
Geometrically-structured maximum-girth LDPC block and convolutional codes
inferred← citeshttps://doi.org/10.1109/ncc.2010.5430239openalex-snapshot
Common architecture for decoding turbo and LDPC codes
inferred← citeshttps://doi.org/10.1109/pacrim.1997.620364openalex-snapshot
Gus' last theorem? Fast multiplication in GF (2/sup m/)
inferred← citeshttps://doi.org/10.1109/proc.1983.12545openalex-snapshot
Soft decoding performance of extremal self-dual codes
inferred← citeshttps://doi.org/10.1109/proc.1983.12650openalex-snapshot
The (151, 136) 10th-power residue code and its performance
inferred← citeshttps://doi.org/10.1109/tcom.1986.1096498openalex-snapshot
On Tail Biting Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2003.816996openalex-snapshot
Boosting the error performance of suboptimal tailbiting decoders
inferred← citeshttps://doi.org/10.1109/tcomm.2003.818084openalex-snapshot
Two decoding algorithms for tailbiting codes
inferred← citeshttps://doi.org/10.1109/tcomm.2018.2790935openalex-snapshot
A Low-Complexity Maximum-Likelihood Decoder for Tail-Biting Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tencon.1990.152570openalex-snapshot
Rayleigh fading simulation on PCs
inferred← citeshttps://doi.org/10.1109/tit.1986.1057135openalex-snapshot
Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
inferred← citeshttps://doi.org/10.1109/tit.1986.1057243openalex-snapshot
Binary unequal error-protection block codes formed from convolutional codes by generalized tail-biting
inferred← citeshttps://doi.org/10.1109/tit.2002.801475openalex-snapshot
Tailbiting codes obtained via convolutional codes with large active distance-slopes
inferred← citeshttps://doi.org/10.1109/tit.2003.815798openalex-snapshot
New quasi-twisted degenerate ternary linear codes
inferred← citeshttps://doi.org/10.1109/tit.2003.819337openalex-snapshot
New binary one-generator quasi-cyclic codes
inferred← citeshttps://doi.org/10.1109/tit.2004.825402openalex-snapshot
Lower Bounds on the State Complexity of Linear Tail-Biting Trellises
inferred← citeshttps://doi.org/10.1109/tit.2004.828093openalex-snapshot
A BEAST for Prowling in Trees
inferred← citeshttps://doi.org/10.1109/tit.2004.831857openalex-snapshot
On Error Exponents for Woven Convolutional Codes With One Tailbiting Component Code
inferred← citeshttps://doi.org/10.1109/tit.2004.833342openalex-snapshot
Low State Complexity Block Codes Via Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2004.838358openalex-snapshot
A New Upper Bound on the Minimum Distance of Turbo Codes
inferred← citeshttps://doi.org/10.1109/tit.2004.838370openalex-snapshot
LDPC Block and Convolutional Codes Based on Circulant Matrices
inferred← citeshttps://doi.org/10.1109/tit.2005.846448openalex-snapshot
BEAST Decoding of Block Codes Obtained Via Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2006.872980openalex-snapshot
Algebraic lower bounds on the free distance of convolutional codes
inferred← citeshttps://doi.org/10.1109/tit.2009.2034787openalex-snapshot
Woven Graph Codes: Asymptotic Performances and Examples
inferred← citeshttps://doi.org/10.1109/tit.2009.2034882openalex-snapshot
Decoding of High Rate Convolutional Codes Using the Dual Trellis
inferred← citeshttps://doi.org/10.1109/tit.2010.2053873openalex-snapshot
Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2012.2211995openalex-snapshot
Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2015.2401040openalex-snapshot
On the Algebraic Structure of Linear Tail-Biting Trellises
inferred← citeshttps://doi.org/10.1109/tit.2015.2453267openalex-snapshot
Spatially Coupled LDPC Codes Constructed From Protographs
inferred← citeshttps://doi.org/10.1109/tit.2016.2593451openalex-snapshot
Spectral Analysis of Quasi-Cyclic Product Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2616467openalex-snapshot
Multidimensional Quasi-Cyclic and Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.3031207openalex-snapshot
Cyclic and Convolutional Codes With Locality
inferred← citeshttps://doi.org/10.1109/tit.2021.3071743openalex-snapshot
Spatially Coupled Generalized LDPC Codes: Asymptotic Analysis and Finite Length Scaling
inferred← citeshttps://doi.org/10.1109/tit.2023.3322771openalex-snapshot
Formally Unimodular Packings for the Gaussian Wiretap Channel
inferred← citeshttps://doi.org/10.1109/tit.2024.3364489openalex-snapshot
Improved Spectral Bound for Quasi-Cyclic Codes
inferred← citeshttps://doi.org/10.1109/tsp.2006.880047openalex-snapshot
Critically Subsampled Filterbanks for SISO Reed–Solomon Decoding
inferred← citeshttps://doi.org/10.1109/tsp.2007.898777openalex-snapshot
Filterbank Decompositions for (Non)-Systematic Reed–Solomon Codes With Applications to Soft Decoding
inferred← citeshttps://doi.org/10.1109/tvt.2004.823482openalex-snapshot
Soft-Decision Decoding of Fixed-Rate Entropy-Coded Trellis-Coded Quantizer Over a Noisy Channel
inferred← citeshttps://doi.org/10.1109/twc.2007.060314openalex-snapshot
Concatenated space-time block coding with trellis coded modulation using a delay processor
inferred← citeshttps://doi.org/10.1109/twc.2014.2365822openalex-snapshot
Asynchronous Convolutional-Coded Physical-Layer Network Coding
inferred← citeshttps://doi.org/10.1109/vetec.1993.507021openalex-snapshot
A circular Viterbi algorithm for decoding tailbiting convolutional codes
inferred← citeshttps://doi.org/10.1134/s0032946009040061openalex-snapshot
Graph-based convolutional and block LDPC codes
inferred← citeshttps://doi.org/10.1137/0608063openalex-snapshot
A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm
inferred← citeshttps://doi.org/10.1137/21m1452172openalex-snapshot
State-Space Realizations of Periodic Convolutional Codes
inferred← citeshttps://doi.org/10.1142/s1793830921500166openalex-snapshot
Abelian group factorization from cyclic and quasi-cyclic codes
inferred← citeshttps://doi.org/10.1155/2008/478253openalex-snapshot
Multirate Filter Bank Representations of RS and BCH Codes
inferred← citeshttps://doi.org/10.14209/jcis.1998.10openalex-snapshot
Block Codes Formed from Catastrophic Convolutional Encoders: Applications to BCM
inferred← citeshttps://doi.org/10.1587/essfr.9.4_291openalex-snapshot
Error Trellises and Syndrome Decoding for Convolutional Codes
inferred← citeshttps://doi.org/10.3390/computation11070124openalex-snapshot
Fast Operation of Determining the Sign of a Number in RNS Using the Akushsky Core Function
inferred← citeshttps://doi.org/10.3929/ethz-b-000535284openalex-snapshot
The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel
inferred← citeshttps://doi.org/10.3934/amc.2017045openalex-snapshot
Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields
inferred← citeshttps://doi.org/10.4172/1736-4337.s1-004openalex-snapshot
A Multivariate Weight Enumerator for Tail-biting Trellis Pseudocodewords
inferred← citeshttps://doi.org/10.48550/arxiv.1108.1873openalex-snapshot
Turbo Lattices: Construction and Error Decoding Performance
inferred← citeshttps://doi.org/10.48550/arxiv.1402.6404openalex-snapshot
On the Algebraic Structure of Linear Trellises
inferred← citeshttps://doi.org/10.48550/arxiv.1501.06543openalex-snapshot
Construction of Quasi-Cyclic Product Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1509.08376openalex-snapshot
Matrix Theory for Minimal Trellises
inferred← citeshttps://doi.org/10.48550/arxiv.1702.05153openalex-snapshot
Convolutional encoding of 60,64,68,72-bit self-dual codes
inferred← citeshttps://doi.org/10.48550/arxiv.1705.03982openalex-snapshot
Characteristic Matrices and Trellis Reduction for Tail-Biting Convolutional Codes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0506009openalex-snapshot
Approximate MAP Decoding on Tail-Biting Trellises
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0601023openalex-snapshot
Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises
inferred← citeshttps://doi.org/10.56824/vujs.2019nt40openalex-snapshot
Algebraic structure of cyclic and negacyclic codes over a finite chain ring alphabet and applications
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.