#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1980

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Andreia Teixeira, Armando Matos, Luis Filipe Coelho Antunes
- IEEE Transactions on Information Theory
- 2012

There is no generally accepted definition of conditional Rényi entropy. The (unconditional) Rényi entropy depends on a parameter α, which for the case of min-entropy takes theâ€¦ (More)

- Alexandre Pinto, AndrÃ© Souto, Armando Matos, Luis Filipe Coelho Antunes
- IACR Cryptology ePrint Archive
- 2006

In [3] the authors give the first mathematical formalization of an unconditionally secure commitment scheme. Their construction has some similarities to one used to build authentication codes, soâ€¦ (More)

- Luis Filipe Coelho Antunes, Armando Matos, AndrÃ© Souto, Paul M. B. VitÃ¡nyi
- Theory of Computing Systems
- 2009

Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditional lower bound onâ€¦ (More)

- Andreia Teixeira, Armando Matos, AndrÃ© Souto, Luis Filipe Coelho Antunes
- Entropy
- 2011

Kolmogorov complexity and Shannon entropy are conceptually different measures. However, for any recursive probability distribution, the expected value of Kolmogorov complexity equals its Shannonâ€¦ (More)

- Luis Filipe Coelho Antunes, Armando Matos, Alexandre Pinto, AndrÃ© Souto, Andreia Teixeira
- Theory of Computing Systems
- 2012

We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective,â€¦ (More)

- Andreia Teixeira, AndrÃ© Souto, Armando Matos, Luis Filipe Coelho Antunes
- 2010 IEEE International Symposium on Informationâ€¦
- 2010

Algorithmic entropy and Shannon entropy are two conceptually different information measures, as the former is based on size of programs and the later in probability distributions. However, it isâ€¦ (More)

- António G. Porto, Armando Matos
- SIGA
- 1980

The "arrow" or "surerDower" notation has been introduced by Knuth [I] and it oroves rather convenient to express huge numbers like ~ower yeneralizatJon and, as we shall see, to represent so'~eâ€¦ (More)

- Armando Matos, LÃºÄ±s F. Antunes

Entropy is widely used as a measure of the information contained in a message. It is usually assumed that the symbols of the message are statistically independent. This has as a consequence that theâ€¦ (More)

- Luis Filipe Coelho Antunes, Harry Buhrman, Armando Matos, AndrÃ© Souto, Andreia Teixeira
- Theory of Computing Systems
- 2015

We introduced a new method for distinguishing two probability ensembles called one from each method, in which the distinguisher receives as input two samples, one from each ensemble. We compare thisâ€¦ (More)

- LÃºÄ±s Antunes, Armindo Costa, Armando Matos, Paul M. B. VitÃ¡nyi
- 2007

Bennett introduced the notion of logical depth of an object as the amount of time required for an algorithm to derive the object from a shorter description. He also defined logical depth for infiniteâ€¦ (More)