Publication

Tight bounds on the AUH codes

Publications associées (22)

Optimal Matching of Random Parts

This paper examines the minimization of the cost for an expected random production output, given an assembly of finished goods from two random inputs, matched in two categories. We describe the optimal input portfolio, first using the standard normal appro ...

2022

A Functional Perspective on Information Measures

Amedeo Roberto Esposito

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

EPFL2022

Essays in Financial Economics

Kevin Marc Rageth

This thesis consists of two chapters that study separate subjects in the area of corporate finance. The first chapter, titled â Economic Gains in Bank Mergers and Acquisitions â Evidence from Targetsâ , investigates economic gains in bank mergers and ...

EPFL2022

Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets

Rüdiger Urbanke, Henry Pfister

For any prime power q, Mori and Tanaka introduced a family of q-ary polar codes based on the q x q Reed-Solomon polarization kernels. For transmission over a q-ary erasure channel, they also derived a closed-form recursion for the erasure probability of ea ...

2019

Multi-index Monte Carlo: when sparsity meets sampling

Fabio Nobile

We propose and analyze a novel Multi Index Monte Carlo (MIMC) method for weak approximation of stochastic models that are described in terms of differential equations either driven by random measures or with random coefficients. The MIMC method is both a s ...

Springer2016

A continuation multilevel Monte Carlo algorithm

Fabio Nobile, Erik Gustaf Bogislaw Von Schwerin

We propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for weak approximation of stochastic models. The CMLMC algorithm solves the given approximation problem for a sequence of decreasing tolerances, ending when the required error tolera ...

2015

Re-proving Channel Polarization Theorems : An Extremality and Robustness Analysis

Mine Alsan

The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Arikan proved that this class of codes, ...

EPFL2015

Expected Loss Analysis for Authentication in Constrained Channels

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a number of authentication protocols, where at least some part of the authentication ...

IOS Press2015

The economic performance of Swiss drinking water utilities

Andrea Baranzini, Anne-Kathrin Faust

This paper measures the performance in terms of costs of Swiss drinking water utilities accounting for environmental factors. We estimate a translog stochastic variable cost frontier using two different techniques on an unbalanced panel of 141 water distri ...

Springer Verlag2014

Inventory Leanness and the Financial Performance of the Firm

Ralf Seifert, Olov Isaksson

This paper examines the financial consequences that inventory leanness has on firm performance. We conduct an econometric analysis using 4324 publicly traded US manufacturing companies for the period 1980-2008. Using an instrumental variable fixed effects ...

2014

Linear Programming Decoding of Spatially Coupled Codes

Rüdiger Urbanke, Badih Ghazi

For a given family of spatially coupled codes, we prove that the linear programming (LP) threshold on the binary-symmetric channel (BSC) of the tail-biting graph cover ensemble is the same as the LP threshold on the BSC of the derived spatially coupled ens ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Data Compression via Logic Synthesis

Giovanni De Micheli, Andreas Peter Burg, Luca Gaetano Amarù, Pierre-Emmanuel Julien Marc Gaillardon

Nowadays, most software and hardware applications are committed to reduce the footprint and resource usage of data. In this general context, lossless data compression is a beneficial technique that encodes information using fewer (or at most equal number o ...

2014

Successive Refinement of Gaussian Projections

Michael Christoph Gastpar, Guillaume Jean Op 't Veld

Successive refinement is a technique to encode a source iteratively, improving the distortion at each step. If the code rates of all steps combined can be as efficient as coding only for the final distortion in one go, then the source is said to be success ...

2014

The Economics of Water Distribution in Switzerland : Cost, Efficiency and Climate Change

Anne-Kathrin Faust

This thesis analyses three distinct aspects of the economics of water distribution in Switzerland. Climate change and mounting pressure regarding the performance of network industries command an understanding of the drivers of cost and efficiency of water ...

EPFL2013

Constrained Binary Identification Problem

Amin Karbasi, Morteza Zadimoghaddam

We consider the problem of building a binary decision tree, to locate an object within a set by way of the least number of membership queries. This problem is equivalent to the “20 questions game” of information theory and is closely related to lossless so ...

2013

Operational Decisions and Supply Chain Dynamics : An Empirical Investigation

Olov Isaksson

While traditional research in operations management has focused on mathematical models for improving the flow of physical goods and information, this dissertation takes a quantitative empirical approach. With three distinct research projects it revisits ce ...

EPFL2013

Irregular Product Codes

Mohammad Amin Shokrollahi, Masoud Alipour Babaei, Ghid Maatouk, Seyed Omid Etesami

We introduce irregular product codes, a class of codes where each codeword is represented by a matrix and the entries in each row (column) of the matrix come from a component row (column) code. As opposed to standard product codes, we do not require that a ...

Ieee2012

Tight Bounds on the Redundancy of Huffman Codes

Ali Kakhbod

In this paper, we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound on the redundancy of such Huffman c ...

Ieee-Inst Electrical Electronics Engineers Inc2012

Essays in Financial Economics

Jan Peter Kulak

In the first chapter of this thesis, I empirically show that the time delay firms face in raising outside capital affects cash holdings. I exploit the 2005 US Securities Offering Reform (the Reform) as a quasi-natural experiment. For a subset of large publ ...

EPFL2012

Anti-uniform Huffman codes

In this study, the authors consider the class of anti-uniform Huffman (AUH) codes. The authors derived tight lower and upper bounds on the average codeword length, entropy and redundancy of finite and infinite AUH codes in terms of the alphabet size of the ...

2011