Results 21 to 30 of about 103,237 (307)
Lossless Image Coding Using Non-MMSE Algorithms to Calculate Linear Prediction Coefficients
Entropy, 2023 This paper presents a lossless image compression method with a fast decoding time and flexible adjustment of coder parameters affecting its implementation complexity.
Grzegorz Ulacha, Mirosław Łazoryszczak
doaj +1 more source
Journal of Combinatorial Theory, Series A, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hanno Lefmann +2 more
openaire +1 more source
Binary Linear Locally Repairable Codes [PDF]
IEEE Transactions on Information Theory, 2016 Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do not explicitly take into consideration the field size $q$, i.e., the size of the code alphabet.
Pengfei Huang 0001 +3 more
openaire +2 more sources
Error Exponents of LDPC Codes under Low-Complexity Decoding
Entropy, 2021 This paper deals with the specific construction of binary low-density parity-check (LDPC) codes. We derive lower bounds on the error exponents for these codes transmitted over the memoryless binary symmetric channel (BSC) for both the well-known maximum ...
Pavel Rybin +2 more
doaj +1 more source
Range Analysis of Binaries with Minimal Effort [PDF]
, 1992 COTS components are ubiquitous in military, industrial and governmental systems. However, the bene?fits of reduced development and maintainance costs are compromised by security concerns.
Barrett, Edd, King, Andy
core +1 more source
Analysis of Linear Block Codes as Sources with Memory
Advances in Electrical and Computer Engineering, 2010 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
On the Pseudocodeword Redundancy of Binary Linear Codes [PDF]
IEEE Transactions on Information Theory, 2012 The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary linear code are defined to be the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of the code. It is shown that most codes do not have a finite pseudocodeword redundancy.
Jens Zumbrägel +2 more
openaire +2 more sources
Logical Clifford Synthesis for Stabilizer Codes
IEEE Transactions on Quantum Engineering, 2020 Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators to be translated into physical operators acting on physical quantum states.
Narayanan Rengaswamy +3 more
doaj +1 more source
BinSlayer: Accurate Comparison of Binary Executables [PDF]
, 2013 As the volume of malware inexorably rises, comparison of binary code is of increasing importance to security analysts as a method of automatically classifying new malware samples; purportedly new examples of malware are frequently a simple evolution of ...
Martial Bourquin +5 more
core +1 more source
Optimal Binary Linear Complementary Pairs of Codes
Cryptography and Communications, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Whan-Hyuk Choi +3 more
openaire +4 more sources