Sphere-packing bound for block-codes with feedback and finite memory

Date

2010-07-23

Author

Giacomo, Como
Nakiboğlu, Barış

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

222
views

0
downloads

A lower bound bound is established on the error probability of fixed-length block-coding systems with finite memory feedback, which can be described in terms of a time dependent finite state machine. It is shown that the reliability function of such coding systems over discrete memoryless channels is upper-bounded by the sphere-packing exponent.

Subject Keywords

Computer science, Theory & methods, Computer science

URI

https://hdl.handle.net/11511/38919

DOI

https://doi.org/10.1109/isit.2010.5513232

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Time-constrained temporal logic control of multi-affine systems Aydın Göl, Ebru (Elsevier BV, 2013-11-01) In this paper, we consider the problem of controlling a dynamical system such that its trajectories satisfy a temporal logic property in a given amount of time. We focus on multi-affine systems and specifications given as syntactically co-safe linear temporal logic formulas over rectangular regions in the state space. The proposed algorithm is based on estimating the time bounds for facet reachability problems and solving a time optimal reachability problem on the product between a weighted transition syste...
Disparity disambiguation by fusion of signal- and symbolic-level information Ralli, Jarno; Diaz, Javier; Kalkan, Sinan; Krueger, Norbert; Ros, Eduardo (Springer Science and Business Media LLC, 2012-01-01) We describe a method for resolving ambiguities in low-level disparity calculations in a stereo-vision scheme by using a recurrent mechanism that we call signal-symbol loop. Due to the local nature of low-level processing it is not always possible to estimate the correct disparity values produced at this level. Symbolic abstraction of the signal produces robust, high confidence, multimodal image features which can be used to interpret the scene more accurately and therefore disambiguate low-level interpretat...
Parallel Scalable PDE Constrained Optimization Antenna Identification in Hyperthermia Cancer Treatment Planning SCHENK, Olaf; Manguoğlu, Murat; CHRİSTEN, Matthias; SATHE, Madan (Springer Science and Business Media LLC, 2009-01-01) We present a PDE-constrained optimization algorithm which is designed for parallel scalability on distributed-memory architectures with thousands of cores. The method is based on a line-search interior-point algorithm for large-scale continuous optimization, it is matrix-free in that it does not require the factorization of derivative matrices. Instead, it uses a new parallel and robust iterative linear solver on distributed-memory architectures. We will show almost linear parallel scalability results for t...
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes Özbudak, Ferruh (Elsevier BV, 2014-02-06) Probabilistic simultaneous polynomial reconstruction algorithm of Bleichenbacher, Kiayias, and Yung is extended to the polynomials whose degrees are allowed to be distinct. Specifically, for a finite field F, positive integers n, r, t and distinct elements z(1), z(2), ... , z(n) is an element of F, we present a probabilistic algorithm which can recover polynomials p(1), p(2), p(r) is an element of F[x] of degree less than k(1), k(2), ... , k(r) respectively for a given instance < y(i), (1, ... ,) y(i,r)>(n)...
Monte Carlo analysis of ridged waveguides with transformation media Ozgun, Ozlem; Kuzuoğlu, Mustafa (Wiley, 2013-07-01) A computational model is presented for Monte Carlo simulation of waveguides with ridges, by combining the principles of transformation electromagnetics and the finite methods (such as finite element or finite difference methods). The principle idea is to place a transformation medium around the ridge structure, so that a single and easy-to-generate mesh can be used for each realization of the Monte Carlo simulation. Hence, this approach leads to less computational resources. The technique is validated by me...

Citation Formats

C. Giacomo and B. Nakiboğlu, “Sphere-packing bound for block-codes with feedback and finite memory,” 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38919.