Results 1 to 10 of about 4,095 (149)
Topologies for Error-Detecting Variable-Length Codes [PDF]
Given a finite alphabet $A$, a quasi-metric $d$ over $A^*$, and a non-negative integer $k$, we introduce the relation $\tau_{d,k}\subseteq A^*\times A^*$ such that $(x,y)\in\tau_{d,k}$ holds whenever $d(x,y)\le k$.
Jean N'eraud
semanticscholar +1 more source
When Variable-Length Codes Meet the Field of Error Detection [PDF]
Given a finite alphabet $A$ and a binary relation $\tau\subseteq A^*\times A^*$, a set $X$ is $\tau$-{\it independent} if $ \tau(X)\cap X=\emptyset$.
Jean N'eraud
semanticscholar +1 more source
On non-expandable cross-bifix-free codes [PDF]
A cross-bifix-free code of length $n$ over $\mathbb{Z}_q$ is defined as a non-empty subset of $\mathbb{Z}_q^n$ satisfying that the prefix set of each codeword is disjoint from the suffix set of every codeword.
Chunyan Qin, Bocong Chen, Gaojun Luo
semanticscholar +1 more source
Rate of Prefix-free Codes in LQG Control Systems with Side Information [PDF]
In this work, we study an LQG control system where one of two feedback channels is discrete and incurs a communication cost. We assume that a decoder (co-located with the controller) can make noiseless measurements of a subset of the state vector ...
Travis C. Cuvelier, Takashi Tanaka
semanticscholar +1 more source
Time-invariant prefix-free source coding for MIMO LQG control [PDF]
In this work we consider discrete-time multiple-input multiple-output (MIMO) linear-quadratic-Gaussian (LQG) control where the feedback consists of variable length binary codewords.
Travis C. Cuvelier +2 more
semanticscholar +1 more source
Rate of prefix-free codes in LQG control systems [PDF]
In this paper, we consider a discrete time linear quadratic Gaussian (LQG) control problem in which state information of the plant is encoded in a variable-length binary codeword at every time step, and a control input is determined based on the ...
Takashi Tanaka +4 more
semanticscholar +1 more source
Online Variable-Length Source Coding for Minimum Bitrate LQG Control [PDF]
We propose an adaptive coding approach to achieve linear-Quadratic-Gaussian (LQG) control with near-minimum bitrate prefix-free feedback. Our approach combines a recent analysis of a quantizer design for minimum rate LQG control with work on universal ...
Travis C. Cuvelier +2 more
semanticscholar +1 more source
ADAPTIVE CYCLIC PREFIX LENGTH FOR CONVOLUITIONAL CODE OFDM SYSTEM IN FREQUENCY SELECTIVE CHANNEL
Orthogonal Frequency Division Multiplexing (OFDM) is one of recent years multicarrier modulation used in order to combat the Inter Symbol Interference (ISI) introduced by frequency selective mobile radio channel. The circular extension of the data symbol,
A. A. Aljanaby +1 more
semanticscholar +1 more source
Restrictions and Generalizations on Comma-Free Codes
A significant sector of coding theory is that of comma-free coding; that is, codes which can be received without the need of a letter used for word separation.
Alexander L. Churchill
semanticscholar +1 more source
Variable-Length Non-Overlapping Codes [PDF]
We define a variable-length code having the property that no (non-empty) prefix of each its codeword is a suffix of any other one, and vice versa.
S. Bilotta
semanticscholar +1 more source

