Related papers: Tree structured sparse coding on cubes
Scalar quantization and probabilistic shaping are applied to the distributed source coding of Gaussian sources, with mean-square error distortion. A coding scheme with a modulo interval, dithering, and truncated Gaussian shaping is shown to…
This thesis develops the theory of bundle gerbes and examines a number of useful constructions in this theory. These allow us to gain a greater insight into the structure of bundle gerbes and related objects. Furthermore they naturally lead…
Asymmetric quantum error-correcting codes are quantum codes defined over biased quantum channels: qubit-flip and phase-shift errors may have equal or different probabilities. The code construction is the Calderbank-Shor-Steane construction…
Subsystem codes protect quantum information by encoding it in a tensor factor of a subspace of the physical state space. Subsystem codes generalize all major quantum error protection schemes, and therefore are especially versatile. This…
In this paper, we describe the structural properties of the cone of $\mathcal{Z}$-transformations on the second order cone in terms of the semidefinite cone and copositive/completely positive cones induced by the second order cone and its…
Linear layered probabilistic shaping (LLPS) is proposed, an architecture for linear codes to efficiently encode to shaped code words. In the previously proposed probabilistic amplitude shaping (PAS) architecture, a distribution matcher (DM)…
We present a simple combinatorial proof of Postnikov's hook length formula for binary trees.
Tree-structured neural networks encode a particular tree geometry for a sentence in the network design. However, these models have at best only slightly outperformed simpler sequence-based models. We hypothesize that neural sequence models…
This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures and constructions are stated. The existence problem is also discussed and known results for some particular cases are…
It is shown that polar coding schemes achieve the known achievable rate regions for several multi-terminal communications problems including lossy distributed source coding, multiple access channels and multiple descriptions coding. The…
Sparse superimposed coding (SSC) has emerged as a promising technique for short-packet transmission in ultra-reliable low-latency communication scenarios. However, conventional SSC schemes often suffer from high encoding and decoding…
Convolutional Sparse Coding (CSC) is a well-established image representation model especially suited for image restoration tasks. In this work, we extend the applicability of this model by proposing a supervised approach to convolutional…
This paper reduces discontinuous parsing to sequence labeling. It first shows that existing reductions for constituent parsing as labeling do not support discontinuities. Second, it fills this gap and proposes to encode tree discontinuities…
In this paper we describe the blocks of the partition algebra over a field of positive characteristic.
A few notes about infinite trees in a descriptive set-theoretic setting.
Coded recurrent neural networks with three levels of sparsity are introduced. The first level is related to the size of messages, much smaller than the number of available neurons. The second one is provided by a particular coding rule,…
Network coding is a technique to maximize communication rates within a network, in communication protocols for simultaneous multi-party transmission of information. Linear network codes are examples of such protocols in which the local…
In this paper, we consider some structures of linear codes over the ring $\mathcal{R}_k=R[v_1,\dots,v_k],$ where $v_i^2=v_i$ forall $i=1,\dots,k),$ and $R$ is a finite commutative Frobenius ring.
A new class of spherical codes is constructed by selecting a finite subset of flat tori from a foliation of the unit sphere S^{2L-1} of R^{2L} and designing a structured codebook on each torus layer. The resulting spherical code can be the…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…