A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
On a characterization of some class of M-dependent channels with finite memory and finite anticipation
1976
Information and Control
Preserved Fulltext
., b) be a stochastic matrix constituting a Marhovian channel with finite memory and finite anticipation of the lengths L and J. ...
Then we can construct a M-dependent channel without memory and anticipation if and only if p~V+l=O, f= 1 .... ,a,
hold together, provided b ~ M -}-2. Proof. ...
doi:10.1016/s0019-9958(76)90525-8
fatcat:syey3bdlrbbmnajahftj2cnvhq
Page 1058 of Mathematical Reviews Vol. 53, Issue 3
[page]
1977
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
INFORMATION AND COMMUNICATION, CIRCUITS, AUTOMATA
1058
Takano, Seiji 7621 On a characterization of some class of M-dependent channels with finite memory and finite anticipation. ...
In a previous paper [Information and Control 25 (1974), 329-340; MR 49 #10449], the author studied a class of M-dependent com- munication channels with finite memory and finite anticipation that appears ...
Page 1548 of Mathematical Reviews Vol. 57, Issue 4
[page]
1979
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Channels with asymptotically decreasing memory and anticips. communication. tion. ...
The author defines a discrete channel with asymptotically decreas. ing memory and anticipation. ...
Page 6066 of Mathematical Reviews Vol. , Issue 98I
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The contents of the book include Shannon’s information measures, discrete and continuous infor- mation sources, information channels with and without memory, source and channel coding with a digression ...
In this paper, upper bounds are obtained on the smallest at- tainable number of states of any (S,n)-encoder with anticipation ...
Finite-state modulation codes for data storage
1992
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
A rate p : q jnite state encoder accepts an input block of p user bits and generates a length q codeword depending on the input block and the current internal state of the encoder. ...
The encoder typically takes the form of a synchronous finite-state-machine, shown schematically in Fig. 3 . ...
cover) with memory m and anticipation 0 (for some m). ...
doi:10.1109/49.124467
fatcat:i7fwn557xjhlfesmtsp7y5em4e
Computational Mechanics of Input–Output Processes: Structured Transformations and the $$\epsilon $$ ϵ -Transducer
2015
Journal of statistical physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
It is the first in a series on the structural information theory of memoryful channels, channel composition, and allied conditional information measures. ...
Here, we lay the foundation of a structural analysis of communication channels, treating joint processes and processes with input. ...
Army Research Laboratory and the U. S. Army Research Office under contract numbers W911NF-12-1-0234 and W911NF-13-1-0390. NB was partially supported by NSF VIGRE grant DMS0636297. ...
doi:10.1007/s10955-015-1327-5
fatcat:qlsbsyarjbhtjne347hnjukqja
A general formula for channel capacity
1994
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The key to this result is a new converse approach based on a simple new lower bound on the error probability of m-ary hypothesis tests among equiprobable hypotheses. ...
A formula for the capacity of arbitrary single-user channels without feedback (not necessarily information stable, stationary, etc.) is proved. ...
Another class of chanels that are not necessarily information stable was studied by Winkelbauer [7]: stationary discrete regular decomposable channels with finite input memory. ...
doi:10.1109/18.335960
fatcat:pcg4rjztx5bh3h4ptqjpxp2yci
Markov Modeling of Time-Series Data using Symbolic Analysis
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Clearly, the effectiveness of signal representation as a discrete Markov process depends on both these steps. ...
We will present some results from literature on partitioning from dynamical systems theory and order estimation using concepts of information theory and statistical learning. ...
The states of this PFSA are words over A of length D (or less); and state transitions are described by a sliding block code of memory D and anticipation length of one [44] . ...
arXiv:2103.11238v2
fatcat:slbn5m3bsfejtccuinmndz2eme
Matched spectral-null codes for partial-response channels
1991
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
It is shown that matched-spectral-nul1 sequences provide a distance gain on the order of 3 dB and higher for a broad class of partial-response channels, including many of those of primary interest in practical ...
The codes are intended for use on channels where the input alphabet size is limited. These channels arise in the context of digital data recording and certain data transmission applications. ...
The authors additionally thank Hiroshi Kamabe for informing us of several in the Japanese literature papers relevant to spectral null characterization, and Lyle Fredrickson for assistance with computer ...
doi:10.1109/18.79951
fatcat:jxawsgs5trex7pp2iniiepzhpa
Some topologies on the set of discrete stationary channels
1983
Pacific Journal of Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
) is the closure in § of the set of channels with input finite memory and anticipation. ...
Some topologies are defined on the set S of all discrete stationary channels with given finite input and output alphabets, which are weaker than the topology of Neuhoff and Shields arising from the d concept ...
Please propose a heading for the odd numbered pages of less than 35 characters. Manuscripts, in triplicate, may be sent to any one of the editors. Please classify according to the scheme of Math. ...
doi:10.2140/pjm.1983.105.359
fatcat:zygmnxvo3fcmtdj3od3nvof2by
On Trellis-Based Truncated-Memory Detection
2005
IEEE Transactions on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A general approach to the design of truncated-memory (TM) FB algorithms is proposed, and two main classes of algorithms, characterized by coupled and decoupled recursions, respectively, are presented. ...
We propose a general framework for trellis-based detection over channels with infinite memory. ...
In particular, the Editor suggested the extension of the CR architecture to include extended completion, which made the overall paper more insightful and complete. ...
doi:10.1109/tcomm.2005.855008
fatcat:ey5zniwxgrbtxgnlpzbkrlcjri
Communication through a quantum link
2009
Physical Review A. Atomic, Molecular, and Optical Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We show that over repeated uses without resetting the study of a quantum link can be connected to correlated quantum channels with finite dimensional environment (finite memory quantum channel). ...
Then, using coding arguments for such kind of channels and results on mixing channels we present a protocol that allows us to achieve perfect information transmission through a quantum link. ...
Such class of channels may be extended to include all sequences of CPTP maps that have a representation with a finite upper bound on the dimension of the environment state. ...
doi:10.1103/physreva.79.012311
fatcat:lt7ecbq2bzcxzb6g6hatsci6ne
Empirically Efficient Verification for a Class of Infinite-State Systems
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The algorithm exploits finite-state symbolic model checking and was shown to outperform the classical WSTS verification algorithm on a contrived example family of petri nets. ...
In this work, we generalize the earlier results to handle a larger class of WSTS, which we dub nicely sliceable, that includes broadcast protocols, petri nets, context-free grammars, and lossy channel ...
All experiments were run on a machine with an Intel Pentium 4 at 2.6GHz and 4GB total memory. ...
doi:10.1007/978-3-540-31980-1_6
fatcat:qjnypti6azgvveq76vcmw4xjvm
Maximum transition run codes for generalized partial response channels
2001
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Deterministic finite-state transition diagrams that present the twins constraint are specified, and the capacity of the new class of MTR constraints is computed. ...
A new twins constraint for maximum transition run (MTR) codes is introduced to eliminate quasi-catastrophic error propagation in sequence detectors for generalized partial response channels with spectral ...
Galbraith for collaborations on practical aspects of code designs, and R. Olson for suggesting the use of MTR codes in conjunction with write precompensation schemes. They additionally thank M. ...
doi:10.1109/49.920171
fatcat:r4pdq75fojeyhdd2sftruzd5bu
Cornerstones of Sampling of Operator Theory
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper reviews some results on the identifiability of classes of operators whose Kohn-Nirenberg symbols are band-limited (called band-limited operators), which we refer to as sampling of operators. ...
We examine in detail the original proof of the third-named author characterizing identifiability of channels in terms of the maximum time and Doppler spread of the channel, and do the same for the subsequent ...
the
bandwidths of the input signal and the duration of the channel memory. ...
arXiv:1502.03451v1
fatcat:ir362uzekfhjfmnyt53jwtriyy
« Previous
Showing results 1 — 15 out of 10,472 results