Related papers: Galois Field Arithmetics for Linear Network Coding…
We consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr \emph{et al.} [1], we propose network codes that achieve up to a constant gap from the capacity of such networks. However,…
Network coding is known as a promising approach to improve wireless network performance. How to discover the coding opportunity in relay nodes is really important for it. There are more coding chances, there are more times it can improve…
Normal basis is used in many applications because of the efficiency of the implementation. However, most space complexity reduction techniques for binary field multiplier are applicable for only optimal normal basis or Gaussian normal basis…
We adopt CUDA-capable Graphic Processing Units (GPUs) for Coulomb, Landau and maximally Abelian gauge fixing in 3+1 dimensional SU(3) lattice gauge field theories. The local overrelaxation algorithm is perfectly suited for highly parallel…
We study (Galois) linear complementary dual codes over mixed alphabets arising from finite chain rings. We give a characterization of when a given code is of We study (Galois) linear complementary dual codes over mixed alphabets arising…
Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…
Determining the achievable rate region for networks using routing, linear coding, or non-linear coding is thought to be a difficult task in general, and few are known. We describe the achievable rate regions for four interesting networks…
In recent years, network coding has become one of the most interesting fields and has attracted considerable attention from both industry and academia. The idea of network coding is based on the concept of allowing intermediate nodes to…
We present results of a performance study of an astrophysical radiation hydrodynamics code, V2D, on the Arm-based A64FX processor developed by Fujitsu. The code solves sparse linear systems, a task for which the A64FX architecture should be…
Algebraic codes that achieve list decoding capacity were recently constructed by a careful ``folding'' of the Reed-Solomon code. The ``low-degree'' nature of this folding operation was crucial to the list decoding algorithm. We show how…
We consider a two-unicast-$Z$ network over a directed acyclic graph of unit capacitated edges; the two-unicast-$Z$ network is a special case of two-unicast networks where one of the destinations has apriori side information of the unwanted…
Using tools from algebraic geometry and Groebner basis theory we solve two problems in network coding. First we present a method to determine the smallest field size for which linear network coding is feasible. Second we derive improved…
We consider linear network error correction (LNEC) coding when errors may occur on edges of a communication network of which the topology is known. In this paper, we first revisit and explore the framework of LNEC coding, and then unify two…
In wireless broadcast, random linear network coding (RLNC) over GF(2^L) is known to asymptotically achieve the optimal completion delay with increasing L. However, the high decoding complexity hinders the potential applicability of RLNC…
Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes…
Looking forward to introducing an analysis in Galois Fields, discrete functions are considered (such as transcendental ones) and MacLaurin series are derived by Lagrange's Interpolation. A new derivative over finite fields is defined which…
A new N-dimensional vector space of DNA sequences over the Galois field of the 64 codons (GF(64)) was recently presented. Now, in order to include deletions and insertions (indel mutations), we have defined a new Galois field over the set…
In recent years, network coding has been investigated as a method to obtain improvements in wireless networks. A typical assumption of previous work is that relay nodes performing network coding can decode the messages from sources…
A classic application of description length is for model selection with the minimum description length (MDL) principle. The focus of this paper is to extend description length for data analysis beyond simple model selection and sequences of…
In this paper, a general algorithm is proposed for rate analysis and code design of linear index coding problems. Specifically a solution for minimum rank matrix completion problem over finite fields representing the linear index coding…