Sciweavers

TIT
2010
90views Education» more  TIT 2010»
13 years 5 months ago
Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels
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...
Giacomo Como
SLOGICA
2011
13 years 5 months ago
The Quasi-lattice of Indiscernible Elements
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...
Mauri Cunha do Nascimento, Décio Krause, H&...
AMAST
2010
Springer
13 years 6 months ago
Matching Logic: An Alternative to Hoare/Floyd Logic
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
Grigore Rosu, Chucky Ellison, Wolfram Schulte
CPC
1998
100views more  CPC 1998»
13 years 10 months ago
An Algebraic Proof of Deuber's Theorem
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...
Neil Hindman, Dona Strauss
IJAC
2002
128views more  IJAC 2002»
13 years 10 months ago
Computational Complexity of Generators and Nongenerators in Algebra
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...
Clifford Bergman, Giora Slutzki
IJAC
2007
94views more  IJAC 2007»
13 years 10 months ago
Automorphism Groups of Squares and of Free Algebras
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, ...
Keith A. Kearnes, Steven T. Tschantz
ENTCS
2008
102views more  ENTCS 2008»
13 years 11 months ago
An Algebra for Directed Bigraphs
We study the algebraic structure of directed bigraphs, a bigraphical model of computations with locations, connections and resources previously introduced as a unifying generaliza...
Davide Grohmann, Marino Miculan
AI
2008
Springer
13 years 11 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
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...
Jürg Kohlas, Nic Wilson
FCT
1999
Springer
14 years 3 months ago
Tile Transition Systems as Structured Coalgebras
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...
Andrea Corradini, Reiko Heckel, Ugo Montanari
ISPEC
2005
Springer
14 years 4 months ago
A New Class of Codes for Fingerprinting Schemes
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...
Marcel Fernandez, Miguel Soriano, Josep Cotrina Na...