Search Sciweavers | Sciweavers

58 search results - page 3 / 12

» Perfect Binary Matroids

click to vote

ENDM
2002

47views more ENDM 2002»

Splitting Operation and Connectedness in Binary Matroids

13 years 7 months ago

Download www.new.dli.ernet.in

M. M. Shikare

claim paper

Read More »

click to vote

JCT
2011

66views more JCT 2011»

A chain theorem for internally 4-connected binary matroids

13 years 2 months ago

Download www.math.lsu.edu

Carolyn Chun, Dillon Mayhew, James Oxley

claim paper

Read More »

click to vote

JGT
2010

103views more JGT 2010»

Characterizing 3-connected planar graphs and graphic matroids

13 years 6 months ago

Download www.olemiss.edu

: A well-known result of Tutte states that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cun...

Manoel Lemos, Talmage James Reid, Haidong Wu

claim paper

Read More »

click to vote

DAM
1999

114views more DAM 1999»

Perfect and Almost Perfect Sequences

13 years 7 months ago

Download www.disp.duke.edu

The autocorrelation function of a sequence is a measure for how much the given sequence di ers from its translates. Periodic binary sequences with good correlation properties have...

Dieter Jungnickel, Alexander Pott

claim paper

Read More »

click to vote

CORR
2008
Springer

107views Education» more CORR 2008»

The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification

13 years 7 months ago

Download users.tkk.fi

Abstract The optimal one-error-correcting codes of length 13 that are doubly shortened perfect codes are classified utilizing the results of [

Patric R. J. Östergård, Olli Pottonen

claim paper