TIT
2010
13 years 7 months ago
2010
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two capacityachieving code ensembles with different algebraic structure. It is proved t...
SLOGICA
2011
13 years 7 months ago
2011
The literature on quantum logic emphasizes that the algebraic structures involved with orthodox quantum mechanics are non distributive. In this paper we develop a particular algeb...
AMAST
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
CPC
1998
14 years 3 days ago
1998
Deuber’s Theorem says that, given any m, p, c, r in N, there exist n, q, µ in N such that whenever an (n, q, cµ )-set is r-coloured, there is a monochrome (m, p, c)-set. This t...
IJAC
2002
14 years 6 days ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
IJAC
2007
14 years 11 days ago
2007
We show that certain finite groups do not arise as the automorphism group of the square of a finite algebraic structure, nor as the automorphism group of a finite, 2-generated, ...
ENTCS
2008
14 years 15 days ago
2008
We study the algebraic structure of directed bigraphs, a bigraphical model of computations with locations, connections and resources previously introduced as a unifying generaliza...
AI
2008
Springer
14 years 17 days ago
2008
Springer
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
FCT
1999
Springer
14 years 4 months ago
1999
Springer
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side e ects which a...
ISPEC
2005
Springer
14 years 6 months ago
2005
Springer
Abstract. In this paper we discuss the problem of collusion secure fingerprinting. In the first part of our contribution we prove the existence of equidistant codes that can be u...