Search
ISSN:
eISSN:
Disciplines
(Field of Science):
- architecture and urban planning (Engineering and Technology)
- information and communication technology (Engineering and Technology)
- biomedical engineering (Engineering and Technology)
- social communication and media studies (Social studies)
- management and quality studies (Social studies)
- computer and information sciences (Natural sciences)
(Field of Science)
Ministry points: Help
| Year | Points | List |
|---|---|---|
| Year 2024 | 200 | Ministry scored journals list 2024 |
| Year | Points | List |
|---|---|---|
| 2024 | 200 | Ministry scored journals list 2024 |
| 2023 | 200 | Ministry Scored Journals List |
| 2022 | 200 | Ministry Scored Journals List 2019-2022 |
| 2021 | 200 | Ministry Scored Journals List 2019-2022 |
| 2020 | 200 | Ministry Scored Journals List 2019-2022 |
| 2019 | 200 | Ministry Scored Journals List 2019-2022 |
| 2018 | 40 | A |
| 2017 | 40 | A |
| 2016 | 35 | A |
| 2015 | 40 | A |
| 2014 | 40 | A |
| 2013 | 40 | A |
| 2012 | 45 | A |
| 2011 | 45 | A |
| 2010 | 32 | A |
Model:
Points CiteScore:
| Year | Points |
|---|---|
| Year 2023 | 5.7 |
| Year | Points |
|---|---|
| 2023 | 5.7 |
| 2022 | 5.8 |
| 2021 | 6.2 |
| 2020 | 6.3 |
| 2019 | 6.5 |
| 2018 | 5.6 |
| 2017 | 5.7 |
| 2016 | 6 |
| 2015 | 5.8 |
| 2014 | 6.5 |
| 2013 | 7.1 |
| 2012 | 6.8 |
| 2011 | 6.7 |
Impact Factor:
Sherpa Romeo:
Papers published in journal
Filters
total: 10
Catalog Journals
Year 2021
-
On the Characteristic Graph of a Discrete Symmetric Channel
PublicationWe present some characterizations of characteristic graphs of row and/or column symmetric channels. We also give a polynomial-time algorithm that decides whether there exists a discrete symmetric channel whose characteristic graph is equal to a given input graph. In addition, we show several applications of our results.
Year 2017
-
Amplifying the Randomness of Weak Sources Correlated With Devices
PublicationThe problem of device-independent randomness amplification against no-signaling adversaries has so far been studied under the assumption that the weak source of randomness is uncorrelated with the (quantum) devices used in the amplification procedure. In this paper, we relax this assumption, and reconsider the original protocol of Colbeck and Renner using a Santha-Vazirani (SV) source. To do so, we introduce an SV-like condition...
Year 2016
-
Types of Markov Fields and Tilings
PublicationThe method of types is one of the most popular techniques in information theory and combinatorics. However, thus far the method has been mostly applied to one-dimensional Markov processes, and it has not been thoroughly studied for general Markov fields. Markov fields over a finite alphabet of size m ≥ 2 can be viewed as models for multi-dimensional systems with local interactions. The locality of these interactions is represented...
Year 2014
-
On the Limiting Distribution of Lempel-Ziv’78 Redundancy for Memoryless Sources
PublicationWe study the Lempel-Ziv'78 algorithm and show that its (normalized) redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper, in particular, by presenting a new simplified proof of the central limit theorem (CLT) for the number of phrases in the LZ'78 algorithm. We first analyze the asymptotic behavior of the total path length in the associated digital search...
Year 2013
-
Average Redundancy of the Shannon Code for Markov Sources
PublicationIt is known that for memoryless sources, the average and maximal redundancy of fixed–to–variable length codes, such as the Shannon and Huffman codes, exhibit two modes of behavior for long blocks. It either converges to a limit or it has an oscillatory pattern, depending on the irrationality or rationality, respectively, of certain parameters that depend on the source. In this paper, we extend these findings, concerning the Shannon...
Year 2010
-
A few steps more towards NPT bound entanglement
PublicationIn this paper, existence of bound entangled states with nonpositive partial transpose (NPT) is considered. As one knows, existence of such states would in particular imply nonadditivity of distillable entanglement. Moreover, it would rule out a simple mathematical description of the set of distillable states. The particular state, known to be 1-copy nondistillable and supposed to be bound entangled, is considered. The problem of...
Year 2009
-
General paradigm for distilling classical key from quantum states
PublicationIn this paper, we develop a formalism for distilling aclassical key from a quantum state in a systematic way, expandingon our previous work on a secure key from bound entanglement(Horodecki et al., 2005). More detailed proofs, discussion, andexamples are provided of the main results. Namely, we demonstratethat all quantum cryptographic protocols can be recast in away which looks like entanglement theory, with the only changebeing...
-
Squashed entanglement for multipartite states and entanglement measures based on the mixed convex roof
PublicationNew measures of multipartite entanglement are constructedbased on two definitions of multipartite information anddifferent methods of optimizing over extensions of the states. Oneis a generalization of the squashed entanglement where one takesthe mutual information of parties conditioned on the state's extensionand takes the infimum over such extensions. Additivity ofthe multipartite squashed entanglement is proved for both versionsof...
Year 2008
-
Low-dimensional bound entanglement with one-way distillable cryptographic key
PublicationIn this paper, we provide a class of bound entangled states that have positive distillable secure key rate. The smallest state of this kind is 4 circle times 4, which shows that peculiar security contained in bound entangled states does not need high-dimensional systems. We show that for these states a positive key rate can be obtained by one-way Devetak-Winter (DW) protocol. Subsequently, the volume of bound entangled key-distillable...
-
Quantum key distribution based on private states: Unconditional security over untrusted channels with zero quantum capacity
PublicationIn this paper, we prove unconditional security for a quantum key distribution (QKD) protocol based on distilling pbits (twisted ebits) from an arbitrary untrusted state that is claimed to contain distillable key. Our main result is that we can verify security using only public communication-via parameter estimation of the given untrusted state. The technique applies even to bound-entangled states, thus extending QKD to the regime...
seen 917 times