Frontend
Error-correction Decoding for 2D Convolutional Codes with a Generalized Viterbi Algorithm
arXiv math.IT0 views
arXiv:2610.27978v1 Announce Type: new Abstract: Two-dimensional (2D) convolutional codes are a generalization of one-dimensional (1D) convolutional codes and are naturally suitable for encoding two-dimensional data. Although their theoretical properties are well established, practical applications are limited due to the lack of error-correction decoding algorithms. While the Viterbi algorithm provides an efficient decoding method for 1D convolutional codes, no analogous approach exists for the 2D case. In this paper, we introduce a decoding algorithm for 2D convolutional codes, called the 2D Viterbi algorithm, extending the principles of the classical Viterbi algorithm to the two-dimensional setting. The presented 2D Viterbi algorithm works with linear systems representations of 2D convolutional codes and its complexity depends on the dimension of the corresponding 2D linear system. Hence, we also provide several algorithms to obtain 2D realizations of small dimension.
Source:https://arxiv.org/abs/2610.27978Previousinfomeasure-rs: A High-Performance Rust Library for Information-Theoretic Measures and EstimatorsNextCertified Non-Degenerate Maximum-Likelihood Benchmarking of Quantum LDPC Decoders
Related posts
More than a Manipulator: Planning Propellant-Free Attitude Maneuvers for Free-Floating Spacecraft
0arXiv cs.RO
MiniMax H3 Acceleration in ComfyUI: Eleven Graphs Across Model Tier, LoRA, Attention and Cache
0dev.to AI
Goodbye :nth-child! How Modern CSS sibling-index() Works Under the Hood
0dev.to CSS
Fluid sizes with CSS clamp(): practical examples you can copy
0dev.to CSS
Next.js robots.txt: Why You Shouldn't Block /_next/
0dev.to React

React vs Vue en 2026 : versions, code comparé, performances et grille de choix
0dev.to React