#### Filter Results:

- Full text PDF available (99)

#### Publication Year

1977

2017

- This year (1)
- Last 5 years (17)
- Last 10 years (49)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. Levitin
- IEEE Trans. Information Theory
- 1998

—We investigate a new class of codes for the optimal covering of vertices in an undirected graph G such that any vertex in G can be uniquely identified by examining the vertices that cover it. We define a ball of radius t centered on a vertex v to be the set of vertices in G that are at distance at most t from v: The vertex v is then said to cover itself… (More)

- Gérard D. Cohen, Mark G. Karpovsky, Harold F. Mattson, James R. Schatz
- IEEE Trans. Information Theory
- 1985

All known results on covering radius are presented, as well as some new results. There are a number of upper and lower bounds, including asymptotic results, a few exact determinations of covering radius, some extensive relations with other aspects of coding theory through the Reed-Muller codes, and new results on the least covering radius of any linear [II,… (More)

- Kewal K. Saluja, Mark G. Karpovsky
- ITC
- 1983

- David Starobinski, Mark G. Karpovsky, Lev Zakrevski
- INFOCOM
- 2002

Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In this paper, we address the problem of using network calculus in networks of arbitrary topology. For this purpose, we introduce a novel graph-theoretic algorithm, called turn-prohibition (TP),… (More)

- Mark G. Karpovsky, Alexander Taubin
- IEEE Transactions on Information Theory
- 2004

A code C detects error e with probability 1-Q(e),ifQ(e) is a fraction of codewords y such that y, y+e/spl isin/C. We present a class of optimal nonlinear q-ary systematic (n, q/sup k/)-codes (robust codes) minimizing over all (n, q/sup k/)-codes the maximum of Q(e) for nonzero e. We also show that any linear (n, q/sup k/)-code V with n /spl les/2k can be… (More)

- Mark G. Karpovsky, Konrad J. Kulikowski, Alexander Taubin
- CARDIS
- 2004

We present two architectures for protecting a hardware implementation of AES against side-channel attacks known as Differential Fault Analysis attacks. The first architecture, which is efficient for faults of higher multiplicity, partitions the design into linear (XOR gates only) and nonlinear blocks and uses different protection schemes for these blocks.… (More)

- Mark G. Karpovsky, Prawat Nagvajara
- IEEE Trans. Computers
- 1990

- Mark G. Karpovsky, Radomir S. Stankovic, Jaakko Astola
- IEEE Trans. Computers
- 2003

This paper discusses optimization of decisions diagrams (DDs) by total autocorrelation functions. We present an efficient algorithm for construction of Linearly Transformed Binary Decision Diagrams (LT-BDDs) and Linearly transformed multiterminal BDDs (LT-MTBDDs) for systems of Boolean functions, based on linearization of these functions by the… (More)

The early propagation effect found in many logic gates is a potential source of data-dependent power consumption. We show that the effect and the corresponding power dependency can be targeted for successful power analysis attacks in cryptographic hardware. Many of the current balanced gate designs did not directly consider the effect and are vulnerable to… (More)

Hardware implementations of cryptographic algorithms are vulnerable to fault analysis attacks. To detect these attacks we propose an architecture based on robust nonlinear systematic (n,k)-error-detecting codes. These nonlinear codes offer advantages over linear codes since they are capable of providing uniform error detecting coverage independently of the… (More)