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
An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels (Corresp.)
1977
IEEE Transactions on Information Theory
Preserved Fulltext
5 as(R),
on P[e].An Improved Upper Bound on the Block Coding Error Rodemich, Rumsey, and Welch are shown to result in improved upper bounds on the block coding error exponent for binary-input memoryless ...
Exponent for Binary-Input
Discrete Memoryless
Channels
ROBERTJ.McELIECE, MEMBER,IEEE,AND
JIMK.OMURA,
MEMBER, IEEE
Abstract-The
recent upper bounds on the minimum distance
of binary codes given ...
doi:10.1109/tit.1977.1055772
fatcat:il4wv7hzb5ci5mrosmg7azs66e
On the error probability of general trellis codes with applications to sequential decoding (Corresp.)
1977
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 2020; you can also visit the original URL.
The file type is application/pdf.
An Improved Upper Bound on the Block Coding Error Exponent for Binary-Input
Discrete Memoryless
Channels
ROBERTJ.McELIECE, MEMBER,IEEE,AND
JIMK.OMURA,
MEMBER, IEEE
Abstract-The
recent ...
upper bounds on the minimum distance
of binary codes given by McEliece, Rodemich, Rumsey, and Welch
are shown to result in improved upper bounds on the block coding
error exponent for binary-input ...
doi:10.1109/tit.1977.1055771
fatcat:ze4xgxfe5ra5xpwmq3imwxdj6e
Interference Robustness and Security of Impulse-Radio Ultra-Wide Band Networks
2010
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.
Channel estimation is of particular importance for interference mitigation: it allows the receiver to disi cryptographic mechanisms that guarantee that the estimated distance is an upper-bound on the actual ...
We find that with the mandatory modes of the standard and no appropriate countermeasures in place, an external attacker can decrease the measured distance by more than one hundred meters with a very high ...
This implies that the upper-bound on the achievable time-gain is the minimum of (1) the upperbound on the time-gain for the preamble and (2) the upper-bound of the time-gain for the payload. ...
doi:10.5075/epfl-thesis-4698
fatcat:nepg2bkwbvhgpa3gdkvcgb7lt4