Welcome to IEEE Xplore 2.0: Computation of zeta functions counting pseudo-codewords of linear codes

Cart | Sitemap | Help

Abstract


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT

View TOC

Computation of zeta functions counting pseudo-codewords of linear codes
Matsuda, S. Saito, S. Hiramatsu, T.
Fac. of Eng., Hosei Univ., Koganei;

This paper appears in: Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Publication Date: 7-10 Dec. 2008
On page(s): 1-5
Location: Auckland,
ISBN: 978-1-4244-2068-1
INSPEC Accession Number: 10614777
Digital Object Identifier: 10.1109/ISITA.2008.4895507
Current Version Published: 2009-04-28

Abstract
It is described in this document how to compute zeta functions counting unscaled pseudo-codewords of general binary linear codes. This zeta functions are introduced in [2] for cycle codes and extended in [3] for general linear codes. Especially, we show that the zeta functions of codes are computed by using a 1/2 size determinants compared to those of [3] for non-cycle codes.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.

Citing Documents
Available to subscribers and IEEE members.

You are not logged in.

Guests may access Abstract records free of charge.