We present a logic for reasoning on assembly code. The logic is an extension of intuitionistic linear logic with greatest fixed points, pointer assertions for reasoning about the heap, and modalities for reasoning about program execution. One of the modality corresponds to the step relation of the semantics of an assembly code interpreter. Safety is defined as the greatest fixed point of this m...

In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm has time and space complexities in OðlÞ, where l is the length of the code of a BF or DF linear quadtree. 2002 Elsevier Science B.V. All rights reserved.

The growing number of Internet Thing (IoT) and Ultra-Reliable Low Latency Communications (URLCC) use cases in next generation communication networks calls for the development efficient Forward Error Correction (FEC) mechanisms. These usually imply using short to mid-sized information blocks requires low-complexity and/or fast decoding procedures. This paper investigates joint learning mid block...

In this paper, two upper bounds on the achievable code rate of linear block codes for multiple phased-burst correction (MPBC) are presented. One bound is constrained to a maximum correctable cyclic burst length within every subblock, or equivalently a constraint on the minimum error free length or gap within every phased-burst. This bound, when reduced to the special case of a bound for single ...

As an example, take F2, n = 5 and g(x) = x2 + x + 1. The code consists of the 8 codewords 0 · g(x), . . . , (x2 + x + 1) · g(x). Equivalently, we can identify every polynomial with its vector of coefficients to get a codeword in F2 . Verify that a polynomial code is linear and has dimension k = n −m. Also, check that if g(x) = ∑n−k i=0 gix i is the generator polynomial, then an n× k generating ...

Abstract. In this paper, we first show that three public-key (k, n)-traceability schemes can be derived from an [n, u, d]-linear code C such that d ≥ 2k + 1. The previous schemes are obtained as special cases. This observation gives a more freedom and a new insight to this field. For example, we show that BonehFranklin scheme is equivalent to a slight modification of the corrected KurosawaDesme...

In this paper, we study the p-ary linear code Ck(n, q), q = p , p prime, h ≥ 1, generated by the incidence matrix of points and k-dimensional spaces in PG(n, q). We note that the condition k ≥ n/2 arises in results on the codewords of Ck(n, q). For k ≥ n/2, we link codewords of Ck(n, q)\ Ck(n, q) ⊥ of weight smaller than 2q to k-blocking sets. We first prove that such a k-blocking set is unique...

Brualdi et al. introduced the concept of poset codes. In this paper, we consider the problem of classifying all perfect linear codes when the set of coordinate positions is endowed with crown poset structure. We derive a Ramanujan–Nagell type diophantine equation which is satis ed by parameters of perfect linear P-code. Solving this equation, we characterize parameters of one and two error corr...

The van Lint-Wilson AB-method yields a short proof of the Roos bound for the minimum distance of a cyclic code. We use the AB-method to obtain a different bound for the weights of a linear code. In contrast to the Roos bound, the role of the codes A and B in our bound is symmetric. We use the bound to prove the actual minimum distance for a class of dual BCH codes of length q2− 1 over Fq. We gi...