Results 41 to 50 of about 18,205,701 (285)
Graph-Based Codes and Iterative Decoding [PDF]
, 2003 The field of error correcting codes was revolutionized by the introduction of turbo codes in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity.
Khandekar, Aamod Dinkar
core +1 more source
Irregular Precoder-Aided Differential Linear Dispersion Codes
, 2008 —In this treatise, we propose a novel family of serial concatenated IrRegular Convolutional Coded (IRCC) IrRegular Precoded Differential Linear Dispersion Codes (IR-PDLDC).
Nan Wu, Wu, N, Hanzo, L, Lajos Hanzo
core +2 more sources
From Product Codes to Structured Generalized LDPC Codes [PDF]
, 2010 Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors.
Paolini, Enrico +10 more
core +1 more source
Common Complements of Linear Subspaces and the Sparseness of MRD Codes [PDF]
SIAM Journal on applied algebra and geometry, 2020 We consider the problem of estimating the number of common complements of a family of subspaces over a finite field, in terms of the cardinality of the family and its intersection structure.
Anina Gruica, A. Ravagnani
semanticscholar +1 more source
Keynes is alive and well: a survey article
PSL Quarterly Review, 2014 The article reviews "The Collected Writings of John Maynard Keynes", on occasion of the recently published paperback edition of the photostatic reprint. The original edition made available to scholars most of Keynes’s writings and important parts of his
Alessandro Roncaglia
doaj +1 more source
Generic constructions of PoRs from codes and instantiations
Journal of Mathematical Cryptology, 2019 In this paper, we show how to construct – from any linear code – a Proof of Retrievability (𝖯𝗈𝖱{\mathsf{PoR}}) which features very low computation complexity on both the client (𝖵𝖾𝗋𝗂𝖿𝗂𝖾𝗋{\mathsf{Verifier}}) and the server (𝖯𝗋𝗈𝗏𝖾𝗋{\mathsf{Prover}}) sides,
Lavauzelle Julien +1 more
doaj +1 more source
Advanced Engineering Research, 2018 Introduction. Polynomials in several variables over Galois fields provide the basis for the Reed-Muller coding theory, and are also used in a number of cryptographic problems.
V. M. Deundyak, N. S. Mogilevskaya
doaj +1 more source
The SMEFTsim package, theory and tools
Journal of High Energy Physics, 2017 We report codes for the Standard Model Effective Field Theory (SMEFT) in FeynRules — the SMEFTsim package. The codes enable theoretical predictions for dimension six operator corrections to the Standard Model using numerical tools, where predictions can ...
Ilaria Brivio, Yun Jiang, Michael Trott
doaj +1 more source
Information set decoding for ring-linear codes
Designs, Codes and CryptographyInformation set decoding (ISD) algorithms currently offer the most powerful tool to solve the two archetypal problems of coding theory, namely the codeword finding problem and the syndrome decoding problem.
Giulia Cavicchioni +2 more
semanticscholar +1 more source
Entropy, 2018 We illustrate how computer-aided methods can be used to investigate the fundamental limits of the caching systems, which are significantly different from the conventional analytical approach usually seen in the information theory literature.
Chao Tian
doaj +1 more source