Results 1 to 10 of about 359,214 (184)
Redundancy Allocation of Partitioned Linear Block Codes [PDF]
2013 IEEE International Symposium on Information Theory, 2013 Most memories suffer from both permanent defects and intermittent random errors. The partitioned linear block codes (PLBC) were proposed by Heegard to efficiently mask stuck-at defects and correct random errors.
Kim, Yongjune, Kumar, B. V. K. Vijaya
core +2 more sources
Code multiplexing using linear block codes [PDF]
EPJ Web of ConferencesThis paper explores the application of code multiplexing using linear block codes in communication systems. Through a comprehensive analysis of contemporary literature on switching methods and signal modeling, the study investigates the principles of ...
Rabin Alexey +2 more
doaj +2 more sources
Trellis decoding complexity of linear block codes [PDF]
IEEE Transactions on Information Theory, 1996 In this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total vertices, edges and mergers.
Dolinar, Samuel J, Jr. +4 more
core +4 more sources
On complexity of trellis structure of linear block codes [PDF]
IEEE Transactions on Information Theory, 1993 Summary: First, an upper bound on the number of states of a minimal trellis diagram for a linear block code is derived. It follows from this upper bound that a cyclic (or shortened cyclic) code or its extended code is shown to be the worst in terms of trellis state complexity among the linear codes of the same length and dimension. Then, the complexity
T Kasami
exaly +2 more sources
Voronoi regions for binary linear block codes [PDF]
IEEE Transactions on Information Theory, 1996 Summary: The Voronoi regions of a block code govern many aspects of the code's performance on a Gaussian channel, and they are fundamental instruments in, for example, error probability analysis and soft-decision decoding. This correspondence presents an efficient method to find the boundaries of the Voronoi regions for an arbitrary binary linear block
E Agrell
exaly +2 more sources
Multi-block Two Repeated Fixed Burst Error Correcting Linear Codes
Ratio Mathematica, 2022 During the digital transmission of information, errors are bound to occur. The errors may be random or burst errors. In this paper, we have obtained necessary and sufficient conditions for the existence of linear codes over that are capable of ...
Ritu Arora +3 more
doaj +1 more source
A Simple Neural-Network-Based Decoder for Short Binary Linear Block Codes
Applied Sciences, 2023 The conventional soft decision decoding (SDD) methods require various hard decision decoders (HDDs) based on different codes or re-manipulate the generator matrix by the complicated Gaussian elimination technique according to the bit reliability.
Kunta Hsieh +4 more
doaj +1 more source
The Trapping Redundancy of Linear Block Codes [PDF]
IEEE Transactions on Information Theory, 2009 We generalize the notion of the stopping redundancy in order to study the smallest size of a trapping set in Tanner graphs of linear block codes. In this context, we introduce the notion of the trapping redundancy of a code, which quantifies the relationship between the number of redundant rows in any parity-check matrix of a given code and the size of
Stefan Laendner +3 more
openaire +3 more sources
FPGA implementation of trellis decoders for linear block codes [PDF]
Advances in Radio Science, 2014 Forward error correction based on trellises has been widely adopted for convolutional codes. Because of their efficiency, they have also gained a lot of interest from a theoretic and algorithm point of view for the decoding of block codes.
S. Scholl, E. Leonardi, N. Wehn
doaj +1 more source
Girth-Based Sequential-Recovery LRCs
IEEE Access, 2022 In this paper, we prove that a linear block code with girth $2(t+1)$ is a $t$ -sequential-recovery locally repairable codes (LRCs) with locality $r$ if its parity-check matrix has column weight at least 2 and row weight at most $r+1$ . This gives a
Zhi Jing, Hong-Yeop Song
doaj +1 more source