Results 11 to 20 of about 390,939 (260)

A Non-Blocking Non-Degrading Multiple Defects Link Testing Method for 3D-Networks-on-Chip

open access: yesIEEE Access, 2020
As one of the most promising technologies to realize 3D Integrated Circuits (3D-ICs), Through-Silicon-Via (TSV) acts as the inter-layer link inside 3D Networks-on-Chip.
Khanh N. Dang   +4 more
doaj   +1 more source

Perfect codes in some products of graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2021
A r-perfect code in a graph G = (V(G),E(G)) is a subset C of V(G) for which the balls of radius r centered at the vertices of C form a partition of V(G).
Samane Bakaein   +2 more
doaj   +1 more source

Product construction of affine codes [PDF]

open access: yes2014 IEEE International Symposium on Information Theory, 2014
Binary matrix codes with restricted row and column weights are a desirable method of coded modulation for power line communication. In this work, we construct such matrix codes that are obtained as products of affine codes - cosets of binary linear codes. Additionally, the constructions have the property that they are systematic.
Yeow Meng Chee   +3 more
openaire   +4 more sources

DECODING OF MATRIX-PRODUCT CODES [PDF]

open access: yesJournal of Algebra and Its Applications, 2013
We propose a decoding algorithm for the (u | u + v)-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error-correction capability of the code.
Hernando, Fernando, Ruano Benito, Diego
openaire   +2 more sources

On quantum tensor product codes [PDF]

open access: yesQuantum Information and Computation, 2017
We present a general framework for the construction of quantum tensor product codes (QTPC). In a classical tensor product code (TPC), its parity check matrix is constructed via the tensor product of parity check matrices of the two component codes. We show that by adding some constraints on the component codes, several classes of dual-containing TPCs ...
Jihao Fan   +3 more
openaire   +2 more sources

On tensor products of CSS codes [PDF]

open access: yesAnnales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions, 2019
CSS codes are in one-to-one correspondance with length 3 chain complexes. The latter are naturally endowed with a tensor product \otimes which induces a similar operation on the former. We investigate this operation, and in particular its behavior with regard to minimum distances. Given
Audoux, Benjamin, Couvreur, Alain
openaire   +4 more sources

Balanced Product Quantum Codes [PDF]

open access: yesIEEE Transactions on Information Theory, 2021
23 pages, 11 ...
Nikolas P. Breuckmann   +1 more
openaire   +5 more sources

A Large Scale Code Resolution Service Network in the Internet of Things

open access: yesSensors, 2012
In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately.
Xiangzhan Yu   +3 more
doaj   +1 more source

An Improved Product Code-Based Data Hiding Scheme

open access: yesApplied Sciences, 2018
This paper explores the data hiding schemes which are based on the principle of matrix embedding. Under the same embedding rate, the efficiency of each data hiding scheme is evaluated by the metric of average embedding efficiency. In the literature, both
Wen-Rong Zhang, Yuh-Ming Huang
doaj   +1 more source

Product perfect codes and steganography [PDF]

open access: yesDigital Signal Processing, 2009
A new coding technique to be used in steganography is evaluated. The performance of this new technique is computed and comparisons with the well-known theoretical upper bound, Hamming upper bound and basic LSB are established.
Helena Rifà-Pous, Josep Rifà
openaire   +2 more sources

Home - About - Disclaimer - Privacy