Results 11 to 20 of about 30,579 (293)

On the computational hardness of the code equivalence problem in cryptography [PDF]

open access: yesAdvances in Mathematics of Communications, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alessandro Barenghi   +2 more
exaly   +11 more sources

Reductions Between Code Equivalence Problems [PDF]

open access: yes2025 IEEE International Symposium on Information Theory (ISIT)
In this paper we present two reductions between variants of the Code Equivalence problem. We give polynomial-time Karp reductions from Permutation Code Equivalence (PCE) to both Linear Code Equivalence (LCE) and Signed Permutation Code Equivalence (SPCE).
Mahdi Cheraghchi   +2 more
exaly   +6 more sources

Development of a MOX equivalence Python code package for ANICCA [PDF]

open access: yesEPJ Nuclear Sciences & Technologies, 2021
The basis of the MOX (Mixed OXide) energy equivalence principle is keeping the in-core fuel management characteristics (cycle length, feed size, etc.) of a nuclear reactor unchanged when replacing UOX (Uranium OXide) fuel assemblies by MOX. If the effect
Vermeeren Bart, Druenne Hubert
doaj   +2 more sources

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
exaly   +3 more sources

On Best Erasure Wiretap Codes: Equivocation Matrices and Design Principles [PDF]

open access: yesEntropy
Physical-layer security can aid in establishing secure telecommunication networks including cellular, Internet of Things, and telemetry networks, among others. Channel sounding techniques and/or telemetry systems for reporting channel conditions, coupled
Willie K. Harrison   +3 more
doaj   +2 more sources

An Equivalence between Secure Network and Index Coding [PDF]

open access: yes2016 IEEE Globecom Workshops (GC Wkshps), 2016
We extend the equivalence between network coding and index coding by Effros, El Rouayheb, and Langberg to the secure communication setting in the presence of an eavesdropper. Specifically, we show that the most general versions of secure network-coding setup by Chan and Grant and the secure index-coding setup by Dau, Skachek, and Chee, which also ...
Lawrence Ong   +3 more
openaire   +4 more sources

Comparing Effect Sizes and their Confidence Intervals: A Primer on Equivalence Testing in Educational Research

open access: yesJournal of New Approaches in Educational Research, 2022
This paper’s objective was to teach the Equivalence Testing applied to Educational Research to emphasize recommendations and to increase quality of research.
Hector F. Ponce-Renova
doaj   +1 more source

An equivalence between network coding and index coding [PDF]

open access: yes2013 IEEE International Symposium on Information Theory, 2013
We show that the network coding and index coding problems are equivalent. This equivalence holds in the general setting which includes linear and non-linear codes. Specifically, we present an efficient reduction that maps a network coding instance to an index coding one while preserving feasibility.
Effros, Michelle   +2 more
openaire   +4 more sources

On the Equivalence of Interleavers for Turbo Codes [PDF]

open access: yesIEEE Wireless Communications Letters, 2015
Three of the most common interleavers for turbo codes (TCs) are dithered relative prime (DRP) interleavers, quadratic permutation polynomial (QPP) interleavers, and almost regular permutation (ARP) interleavers. In this paper, it is shown that DRP and QPP interleavers can be expressed in the ARP interleaver function form.
Garzon Bohorquez, Ronald   +2 more
openaire   +3 more sources

On maximum-likelihood decoding with circuit-level errors [PDF]

open access: yesQuantum, 2020
Error probability distribution associated with a given Clifford measurement circuit is described exactly in terms of the circuit error-equivalence group, or the circuit subsystem code previously introduced by Bacon, Flammia, Harrow, and Shi. This gives a
Leonid P. Pryadko
doaj   +1 more source

Home - About - Disclaimer - Privacy