Results 211 to 220 of about 171,073 (263)
Goos-Hänchen shifts in reflection and transmission of gain assisted parity time symmetric conductive medium. [PDF]
Haq ZU +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fooling Parity Tests with Parity Gates
2004We study the complexity of computing k-wise independent and e-biased generators G : {0, 1} n → {0, 1} m . Specifically, we refer to the complexity of computing Gexplicitly, i.e. given x ∈ {0, 1} n and i ∈ {0, 1}log m computing the i-th output bit of G(x).
Dan Gutfreund, Emanuele Viola
openaire +3 more sources
RAIRO - Theoretical Informatics and Applications, 2005
In the paper even codes are defined as prefix codes being able to detect the occurrence of an odd number of 1-bit errors in the message. Particularly, an \textit{even code} is a code in which all encodings are even. After the definition a method for finding optimal even codes is described, and then their characterization as well as comparison with ...
Paulo Eustáquio Duarte Pinto +2 more
openaire +1 more source
In the paper even codes are defined as prefix codes being able to detect the occurrence of an odd number of 1-bit errors in the message. Particularly, an \textit{even code} is a code in which all encodings are even. After the definition a method for finding optimal even codes is described, and then their characterization as well as comparison with ...
Paulo Eustáquio Duarte Pinto +2 more
openaire +1 more source
Risk Parity with Expectiles [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fabio Bellini +3 more
openaire +7 more sources

