Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFinitary Codes, a short survey
110
0
0.0
(
0
)
Authors
Jacek Serafin
Ask ChatGPT about the research
No Arabic abstract
In this note we recall the importance of the notion of a finitary isomorphism in the classification problem of dynamical systems.
rate research
Read More
In this paper, we discuss the generalization of finitary $2$-representation theory of finitary $2$-categories to finitary birepresentation theory of finitary bicategories. In previous papers on the subject, the classification of simple transitive $2$-representations of a given $2$-category was reduced to that for certain subquotients. These reduction results were all formulated as bijections between equivalence classes of $2$-representations. In this paper, we generalize them to biequivalences between certain $2$-categories of birepresentations. Furthermore, we prove an analog of the double centralizer theorem in finitary birepresentation theory.
In this article, we study short exact sequences of finitary 2-representations of a weakly fiat 2-category. We provide a correspondence between such short exact sequences with fixed middle term and coidempotent subcoalgebras of a coalgebra 1-morphism defining this middle term. We additionally relate these to recollements of the underlying abelian 2-representations.
Let FL_s(K) be the finitary linear group of degree s over an associative ring K with unity. We prove that the torsion subgroups of FL_s(K) are locally finite for certain classes of rings K. A description of some f.g. solvable subgroups of FL_s(K) are given.
The rising interest in applications requiring the transmission of small amounts of data has recently lead to the development of accurate performance bounds and of powerful channel codes for the transmission of short-data packets over the AWGN channel. Much less is known about the interaction between error control coding and channel estimation at short blocks when transmitting over channels with states (e.g., fading channels, phase-noise channels, etc...) for the setup where no a priori channel state information (CSI) is available at the transmitter and the receiver. In this paper, we use the mismatched-decoding framework to characterize the fundamental tradeoff occurring in the transmission of short data packet over an AWGN channel with unknown gain that stays constant over the packet. Our analysis for this simplified setup aims at showing the potential of mismatched decoding as a tool to design and analyze transmission strategies for short blocks. We focus on a pragmatic approach where the transmission frame contains a codeword as well as a preamble that is used to estimate the channel (the codeword symbols are not used for channel estimation). Achievability and converse bounds on the block error probability achievable by this approach are provided and compared with simulation results for schemes employing short low-density parity-check codes. Our bounds turn out to predict accurately the optimal trade-off between the preamble length and the redundancy introduced by the channel code.
We study the problems of finding a shortest synchronizing word and its length for a given prefix code. This is done in two different settings: when the code is defined by an arbitrary decoder recognizing its star and when the code is defined by its literal decoder (whose size is polynomially equivalent to the total length of all words in the code). For the first case for every $varepsilon > 0$ we prove $n^{1 - varepsilon}$-inapproximability for recognizable binary maximal prefix codes, $Theta(log n)$-inapproximability for finite binary maximal prefix codes and $n^{frac{1}{2} - varepsilon}$-inapproximability for finite binary prefix codes. By $c$-inapproximability here we mean the non-existence of a $c$-approximation polynomial time algorithm under the assumption P $ e$ NP, and by $n$ the number of states of the decoder in the input. For the second case, we propose approximation and exact algorithms and conjecture that for finite maximal prefix codes the problem can be solved in polynomial time. We also study the related problems of finding a shortest mortal and a shortest avoiding word.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
