Results 21 to 30 of about 359,313 (283)
Analysis of Linear Block Codes as Sources with Memory
The linear, binary, block codes with no equally likely probabilities for the binary symbols are analyzed. The encoding graph for systematic linear block codes is proposed. These codes are seen as sources with memory and the information quantities H(S,X)
ZAHARIA, G. +2 more
doaj +1 more source
In this article codes over lattice valued intuitionistic fuzzy set type-3 (LIFS-3) are defined. Binary block codes and linear codes are constructed over LIFS-3. Hamming distance and related properties of these newly established codes are examined.
Asra Riaz +4 more
doaj +1 more source
The hardness of decoding linear codes with preprocessing [PDF]
The problem of maximum-likelihood decoding of linear block codes is known to be hard. The fact that the problem remains hard even if the code is known in advance, and can be preprocessed for as long as desired in order to device a decoding algorithm, is ...
Bruck, Jehoshua, Naor, Moni
core +1 more source
Relaxed locally correctable codes with nearly-linear block length and constant query complexity [PDF]
Locally correctable codes (LCCs) are codes C: Σk → Σn which admit local algorithms that can correct any individual symbol of a corrupted codeword via a minuscule number of queries.
Chiesa, Alessandro +2 more
core +2 more sources
Blind Interleaver Parameters Estimation Using Kolmogorov–Smirnov Test
The use of error-correcting codes (ECCs) is essential for designing reliable digital communication systems. Usually, most systems correct errors under cooperative environments.
Seungwoo Wee +2 more
doaj +1 more source
This paper presents two new [27,10,9] binary linear block codes which reach the upper bound in [1] for best known codes. They have different spectra as the known [27,10,9] codes constructed by Piret [2], Farkaš and Juling [5].
Peter Farkas, Sergio Herrera-Garcia
doaj +1 more source
Performance Study of a Class of Irregular Near Capacity Achieving LDPC Codes
This paper investigates the performance of a class of irregular low-density parity-check (LDPC) codes through a recently published low complexity upper bound on their beliefpropagation decoding thresholds.
Francesca Vatta +4 more
doaj +1 more source
An Error Control Method with Linear Block Code in Sensor Networks
An error control method is investigated and obtained by combination of the modulation and linear block code in sensor networks. The constructed coding scheme is multistage decoded using a new low-complexity soft-decision decoding method in sensor ...
Yong-Geol Shim
doaj +1 more source
Structured Random Linear Codes (SRLC): Bridging the Gap between Block and Convolutional Codes [PDF]
Several types of AL-FEC (Application-Level FEC) codes for the Packet Erasure Channel exist. Random Linear Codes (RLC), where redundancy packets consist of random linear combinations of source packets over a certain finite field, are a simple yet ...
Asaeda, Hitoshi +2 more
core +3 more sources
On Guaranteed Correction of Error Patterns with Artificial Neural Networks
In this paper, we analyze applicability of single- and two-hidden-layer feed-forward artificial neural networks, SLFNs and TLFNs, respectively, in decoding linear block codes.
S. Brkić, P. Ivaniš, B. Vasić
doaj +1 more source

