DeepAI
AI Chat AI Image Generator AI Video AI Music Generator

The Sphere Packing Bound for DSPCs with Feedback a la Augustin

06/29/2018
∙
by   Barış Nakiboğlu, et al.
∙
0
∙

The sphere packing bound is proved for codes on discrete stationary product channels with feedback following Augustin's proof sketch.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 04/17/2018

The Sphere Packing Bound For Memoryless Channels

Sphere packing bounds (SPBs) ---with prefactors that are polynomial in t...
0 Barış Nakiboğlu, et al. ∙
research
∙ 06/20/2022

Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions

The Cohn-Elkies linear program for sphere packing, which was used to sol...
0 Rupert Li, et al. ∙
research
∙ 12/09/2022

Computability questions in the sphere packing problem

We consider the sets of dimensions for which there is an optimal sphere ...
0 Yuri Manin, et al. ∙
research
∙ 01/02/2019

Generalized Sphere-Packing Bound for Subblock-Constrained Codes

We apply the generalized sphere-packing bound to two classes of subblock...
0 Han Mao Kiah, et al. ∙
research
∙ 02/11/2022

Product-Coproduct Prographs and Triangulations of the Sphere

In this paper, we explain how the classical Catalan families of objects ...
0 Nicolas Borie, et al. ∙
research
∙ 01/27/2021

Non-Asymptotic Converse Bounds Via Auxiliary Channels

This paper presents a new derivation method of converse bounds on the no...
0 Ioannis Papoutsidakis, et al. ∙
research
∙ 12/09/2019

Revisiting zero-rate bounds on the reliability function of discrete memoryless channels

We present a new proof of Berlekamp's zero-rate upper bound on the relia...
0 Marco Bondaschi, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal