Results 21 to 30 of about 2,970,762 (373)
Computation Over Gaussian Networks With Orthogonal Components [PDF]
, 2013 Function computation of arbitrarily correlated discrete sources over Gaussian networks with orthogonal components is studied. Two classes of functions are considered: the arithmetic sum function and the type function.
Chien-yi Wang +3 more
core +2 more sources
On Some Computational and Applications of Finite Fields
Ratio Mathematica, 2020 Finite field is a wide topic in mathematics. Consequently, none can talk about the whole contents of finite fields. That is why this research focuses on small content of finite fields such as polynomials computational, ring of integers modulo p where p ...
Jean Pierre Muhirwa
doaj +1 more source
, 2017 Halbach has argued that Tarski biconditionals are not ontologically conservative over classical logic, but his argument is undermined by the fact that he cannot include a theory of arithmetic, which functions as a theory of syntax.
Heylen, Jan, Horsten, Leon
core +4 more sources
Gaussian width bounds with applications to arithmetic progressions in random settings [PDF]
, 2017 Motivated by problems on random differences in Szemer\'{e}di's theorem and on large deviations for arithmetic progressions in random sets, we prove upper bounds on the Gaussian width of point sets that are formed by the image of the $n$-dimensional ...
Briët, Jop, Gopi, Sivakanth
core +4 more sources
Asymptotically MDS Array BP-XOR Codes [PDF]
, 2017 Belief propagation or message passing on binary erasure channels (BEC) is a low complexity decoding algorithm that allows the recovery of message symbols based on bipartite graph prunning process.
Arslan, Suayb S.
core +2 more sources
Arithmetic Coding with Folds and Unfolds [PDF]
, 2003 Arithmetic coding is a method for data compression. Although the idea was developed in the 1970’s, it wasn’t until the publication of an “accessible implementation” that it achieved the popularity it has today. Over the past ten years arithmetic coding has been refined and its advantages and disadvantages over rival compression schemes, particularly ...
Bird, R, Gibbons, J
openaire +3 more sources
Design of Packet-Based Block Codes with Shift Operators
EURASIP Journal on Wireless Communications and Networking, 2010 This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of k information
Jacek Ilow, Ali Al-Shaikhi
doaj +2 more sources
FPGA-Oriented LDPC Decoder for Cyber-Physical Systems
Mathematics, 2020 A potentially useful Cyber-Physical Systems element is a modern forward error correction (FEC) coding system, utilizing a code selected from the broad class of Low-Density Parity-Check (LDPC) codes. In this paper, development of a hardware implementation
Mateusz Kuc +2 more
doaj +1 more source
Fast and Efficient Entropy Coding Architectures for Massive Data Compression
Technologies, 2023 The compression of data is fundamental to alleviating the costs of transmitting and storing massive datasets employed in myriad fields of our society. Most compression systems employ an entropy coder in their coding pipeline to remove the redundancy of ...
Francesc Auli-Llinas
doaj +1 more source
Weierstrass points on modular curves X0(N) fixed by the Atkin–Lehner involutions [PDF]
Arab Journal of Mathematical Sciences, 2023 Purpose – The authors have determined whether the points fixed by all the full and the partial Atkin–Lehner involutions WQ on X0(N) for N ≤ 50 are Weierstrass points or not.
Mustafa Bojakli, Hasan Sankari
doaj +1 more source