Results 21 to 30 of about 157,158 (262)

Quantum minimal surfaces from quantum error correction

open access: yesSciPost Physics, 2022
We show that complementary state-specific reconstruction of logical (bulk) operators is equivalent to the existence of a quantum minimal surface prescription for physical (boundary) entropies.
Chris Akers, Geoff Penington
doaj   +1 more source

Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem [PDF]

open access: yesQuantum
We introduce a new class of random Gottesman-Kitaev-Preskill (GKP) codes derived from the cryptanalysis of the so-called NTRU cryptosystem. The derived codes are $good$ in that they exhibit constant rate and average distance scaling $\Delta \propto \sqrt{
Jonathan Conrad   +2 more
doaj   +1 more source

On linear equivalence and Phelps codes

open access: yesAdvances in Mathematics of Communications, 2010
It is shown that all non-full-rank FRH-codes, a class of perfect codes we define in this paper, are linearly equivalent to perfect codes obtainable by Phelps' construction. Moreover, it is shown by an example that the class of perfect FRH-codes also contains perfect codes that are not obtainable by Phelps construction.
Olof Heden, Martin Hessler
openaire   +1 more source

Modified Nested Barker Codes for Ultra-Wideband Signal–Code Constructions

open access: yesSensors, 2023
Currently, various applications of ultra-wideband signal–code constructions are among the most vibrant technologies, being implemented in very different fields. The purpose of this research consists of analyzing Barker codes and searching for the optimal
Vadim A. Nenashev   +4 more
doaj   +1 more source

THE CONVOLUTIONAL CODESАNALYSIS TECHNIQUE ON THE OPTIMUM BLOCK CODES GROUNDS

open access: yesInformation and Telecommunication Sciences, 2014
The convolutional codes analysis and synthesis technique is proposed. This technique is optimal according to near Shannon's bound criterion and guarantees a given bit error rate from message source.
Leonid Uryvskyi   +2 more
doaj   +1 more source

On the Distribution in Height of Base Shear Forces in Linear Static Analysis of Base-Isolated Structures

open access: yesBuildings, 2020
Although base isolation is nowadays a well-established seismic-protection technique for both buildings and bridges, and several issues are still open and attract the interest of the research community.
Adamo Zinco   +3 more
doaj   +1 more source

ABOUT CODE EQUIVALENCE — A GEOMETRIC APPROACH

open access: yes, 2022
The equivalence test is a main part in any classification problem. It helps to prove bounds for the main parameters of the considered combinatorial structures and to study their properties. In this paper, we present algorithms for equivalence of linear codes, based on their relation to multisets of points in a projective geometry.
Iliya Bouyukliev, Stefka Bouyuklieva
openaire   +2 more sources

Avoiding coherent errors with rotated concatenated stabilizer codes

open access: yesnpj Quantum Information, 2021
Coherent errors, which arise from collective couplings, are a dominant form of noise in many realistic quantum systems, and are more damaging than oft considered stochastic errors.
Yingkai Ouyang
doaj   +1 more source

Report on Existing Fireproof Construction Guidelines for Dwellings against Wildfires

open access: yesCivilEng, 2023
This work presents a state-of-the-art review of existing fireproof construction guidelines for dwellings against wildfires. The most important wildfire-proof construction guidelines and codes for dwellings are presented, and these are later associated ...
Pedro Cantor   +4 more
doaj   +1 more source

On the Equivalence of NMDS Codes

open access: yesIEEE Transactions on Information Theory
An $[n,k,d]$ linear code is said to be maximum distance separable (MDS) or almost maximum distance separable (AMDS) if $d=n-k+1$ or $d=n-k$, respectively. If a code and its dual code are both AMDS, then the code is said to be near maximum distance separable (NMDS).
Jianbing Lu, Yue Zhou 0001
openaire   +2 more sources

Home - About - Disclaimer - Privacy