Â鶹´«Ã½AV

SPECTRE: short packet communication toolbox
A toolbox for the computation of achievability and converse bound in finite blocklength information theory
Dec 21, 2014
Shannon theory describes fundamental limits of communication and  compression systems. 
Classic closed-form results (such as the well known log(1 + SNR) formula) apply only to the regime of infinite blocklength (infinite packet size/ infinite delay).

For finite blocklengths, no closed-form results are usually obtainable,  but there exist tight upper and lower bounds on fundamental limits, as well as approximations.
The idea behind the SPECTRE project is to create a toolbox that  provides numerical routines for the computation of these bounds and these approximations.

The current version of the toolbox is available on github at the following url:

https://github.com/yp-mit/spectre.git

The toolbox is under development and the participation of  ²¹»å»å¾±³Ù¾±´Ç²Ô²¹±ôÌý members of the information and communication theory communities  to this endeavor is warmly welcomed! 

For questions and access permissions: email  [email protected]