نتایج جستجو برای: parity

تعداد نتایج: 25547  

Journal: :EURASIP J. Wireless Comm. and Networking 2017
Nuwan Balasuriya Chandika B. Wavegedara

Symbol flipping-based hard decision decoding for non-binary low-density parity check (LDPC) codes has attracted much attention due to low decoding complexity even though the error performance of the symbol flipping decoder is inferior to that of the soft decision decoders. Standard symbol flipping decoding involves two steps, selection of the symbol position to be flipped and selection of the f...

2001
Jinghu Chen Marc P. C. Fossorier

In this paper, we propose a normalized a posteriori probability (APP) based algorithm for the decoding of low-density parity check (LDPC) codes. The normalized APP-based algorithm utilizes normalization to improve the accuracy of the soft values delivered by the simplified APP-based algorithm from one iteration to another during the iterative decoding, and can achieve very good tradeoff between...

Journal: :Des. Codes Cryptography 2012
Hans Havlicek Boris Odehnal Metod Saniga

Invariant notions of a class of Segre varieties S(m)(2) of PG(2m − 1, 2) that are direct products of m copies of PG(1, 2), m being any positive integer, are established and studied. We first demonstrate that there exists a hyperbolic quadric that contains S(m)(2) and is invariant under its projective stabiliser group GS(m)(2). By embedding PG(2 m − 1, 2) into PG(2m − 1, 4), a basis of the latte...

2002
Cheng-Pang Liu

The anapole moment is a parity-odd and time-reversal-even electromagnetic moment. Although it was conjectured shortly after the discovery of parity nonconservation, its existence has not been confirmed until recently in heavy nuclear systems, which are known to be the suitable laboratories because of the manybody enhancement. By carefully identifying the nuclear-spin-dependent atomic parity non...

2017
Goutam Paul Anupam Chattopadhyay Chander Chandak

Making a reversible circuit fault-tolerant is much more difficult than classical circuit and there have been only a few works in the area of parity-preserving reversible logic design. Moreover, all of these designs are ad hoc, based on some pre-defined parity preserving reversible gates as building blocks. In this paper, we for the first time propose a novel and systematic approach towards pari...

Journal: :Physical review letters 2007
Y Tanaka A A Golubov

We present a general theory of the proximity effect in junctions between diffusive normal metals (DN) and superconductors. Various possible symmetry classes in a superconductor are considered: even-frequency spin-singlet even-parity (ESE) state, even-frequency spin-triplet odd-parity state, odd-frequency spin-triplet even-parity (OTE) state and odd-frequency spin-singlet odd-parity state. It is...

Journal: :Health affairs 2001
D P Gitterman R Sturm R M Scheffler

The 1996 Mental Health Parity Act (MHPA), which became effective in January 1998, is scheduled to expire in September 2001. This paper examines what the MHPA accomplished and steps toward more comprehensive parity. We explain the strategic and self-reinforcing link of parity with managed behavioral health care and conclude that the current path will be difficult to reverse. The paper ends with ...

2014
Sven Schewe Thomas Varghese

Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We prove that the intermediate determinisation to Rabin automata is optimal. We show that the resulting determinisation to parity automata is optimal up to a sm...

Journal: :CoRR 2015
Mario Blaum

We present simple constructions of optimal erasure-correcting LRC codes by exhibiting their parity-check matrices. When the number of local parities in a parity group plus the number of global parities is smaller than the size of the parity group, the constructed codes are optimal with a field of size at least the length of the code. We can reduce the size of the field to at least the size of t...

1990
Jim Gray Bob Horst Mark Walker

An analysis of mirrored discs and of RAID5 shows that mirrors have considerably better throughput, measured as requests/second on random requests of arbitrary size (up to 1MB). Mirrors have comparable or better response time for requests of reasonable size (less than 100KB). But mirrors have a 100% storage penalty: storing the data twice. Parity striping is a data layout that stripes the parity...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید