Exploració per tema "Codis de correcció d'errors (Teoria de la informació)"
Ara es mostren els items 21-30 de 30
-
Parallelization of the interpolation process in the Koetter-Vardy soft-decision list decoding algorithm
(2012)
Comunicació de congrés
Accés obertList decoding is a decoding strategy that provides a set of codewords at the output of the channel decoder. Since this technique corrects errors beyond the correcting bound of the code, upper layers in the application or ... -
Recobriment i grafs distància-regulars
(Universitat Politècnica de Barcelona. Centre de Càlcul, 1988)
Article
Accés obertUno de los aspectos claves en las telecomunicaciones está relacionado con el uso de los códigos correctores de errores para la transmisión de información. Actualmente se utiliza una clase muy simple de códigos; la ... -
Runtime-guided ECC protection using online estimation of memory vulnerability
(Institute of Electrical and Electronics Engineers (IEEE), 2020)
Text en actes de congrés
Accés obertDiminishing reliability of semiconductor technologies and decreasing power budgets per component hinder designing next-generation high performance computing (HPC) systems. Both constraints strongly impact memory subsystems, ... -
Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
(2019-03-01)
Article
Accés obertWe propose a new approach to construct noise-resistant multimedia fingerprinting codes. Our approach is based on the theory of the signature codes for multiple access channels, mainly, for a weighted noisy adder channel. ... -
SRAM arrays with built-in parity computation for real-time error detection in cache tag arrays
(Institute of Electrical and Electronics Engineers (IEEE), 2021)
Text en actes de congrés
Accés obertThis work proposes an SRAM array with built-in real-time error detection (RTD) capabilities. Each cell in the new RTD-SRAM array computes its part of the real-time parity of an SRAM array column on-the-fly. RTD based arrays ... -
The equivalence of codes
(Universitat Politècnica de Catalunya, 2021-07)
Projecte Final de Màster Oficial
Accés obertWhen discussing equivalent codes, the literature tends to define equivalence differently for linear or nonlinear codes. For non-linear codes, one normally defines equivalence based on a permutation of coordinates and ... -
The equivalence of linear codes implies semi-linear equivalence
(2022-07-01)
Article
Accés obertWe prove that if two linear codes are equivalent then they are semi-linearly equivalent. We also prove that if two additive MDS codes over a field are equivalent then they are additively equivalent. -
The geometry of Hermitian self-orthogonal codes
(Springer, 2021-12-20)
Article
Accés obertWe prove that if n>k2 then a k-dimensional linear code of length n over Fq2 has a truncation which is linearly equivalent to a Hermitian self-orthogonal linear code. In the contrary case we prove that truncations of linear ... -
The geometry of quantum codes
(Universitat Politècnica de Catalunya, 2021-07)
Projecte Final de Màster Oficial
Accés obertQuantum particles are continuously interacting with the environment hence quantum information is always susceptible to errors. Consequently when encoding information into quantum bits a special treatment is required such ... -
Use of Turbo Codes with Low-Rate Convolutional Constituent Codes in Fingerprinting Scenarios
(IEEE, 2011)
Comunicació de congrés
Accés restringit per política de l'editorialWe discuss the use of turbo codes in fingerprinting schemes. More precisely, we present a family of turbo codes that are secure against attacking coalitions of size 2. This family is build upon a class of low-rate convolutional ...
