Sciweavers

2455 search results - page 120 / 491
» Graphical abstract help
Sort
View
DCC
2008
IEEE
16 years 2 months ago
Edge local complementation and equivalence of binary linear codes
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
Lars Eirik Danielsen, Matthew G. Parker
135
Voted
DCC
2007
IEEE
16 years 2 months ago
Efficient pairing computation on supersingular Abelian varieties
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
Paulo S. L. M. Barreto, Steven D. Galbraith, Colm ...
120
Voted
DCC
2007
IEEE
16 years 2 months ago
Towards generating secure keys for braid cryptography
Abstract. Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. S...
Ki Hyoung Ko, Jang-Won Lee, Tony Thomas
114
Voted
DCC
2006
IEEE
16 years 2 months ago
Evaluation codes and plane valuations
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
C. Galindo, M. Sanchis
140
Voted
DCC
2009
IEEE
15 years 9 months ago
Slepian-Wolf Coding of Binary Finite Memory Source Using Burrows-Wheeler Transform
Abstract—In this paper, an asymmetric Slepian-Wolf coding (SWC) scheme for binary finite memory source (FMS) is proposed. The a priori information about the source is extracted ...
Chao Chen, Xiangyang Ji, Qionghai Dai, Xiaodong Li...