𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some Combinatorial Aspects of Constructing Bipartite-Graph Codes

✍ Scribed by Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini…

Book ID
120788657
Publisher
Springer Japan
Year
2011
Tongue
English
Weight
337 KB
Volume
29
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some combinatorial constructions for opt
Some combinatorial constructions for optical orthogonal codes
✍ Jianxing Yin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 942 KB

A (v,k,p) optical orthogonal code ~ is a family of (0,1)-sequences of length v and weight k satisfying the following two properties: (1)~o<.,<.v\_lXtX,+i<~p, for any x = (Xo, x ~ ..... x ~\_ ~ ) e ~ and any integer i ~ 0 (rood v); (2) 5~ o ~, .< ~-~ x~ y, + ~ ~< p, for any x ~ y in ~ and any integer

Constructions of bipartite graphs from f
Constructions of bipartite graphs from finite geometries
✍ Keith E. Mellinger; Dhruv Mubayi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB 👁 1 views

## Abstract We construct an incidence structure using certain points and lines in finite projective spaces. The structural properties of the associated bipartite incidence graphs are analyzed. These __n__ × __n__ bipartite graphs provide constructions of __C__~6~‐free graphs with Ω(__n__^4/3^ edges

Constructing a bipartite graph of maximu
Constructing a bipartite graph of maximum connectivity with prescribed degrees
✍ Asano, Takao 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB 👁 3 views

d 2,n 2 ) is a bipartite graphical sequence, if there is a bipartite graph G with degrees {D 1 , D 2 } (i.e., G has two independent vertex sets In other words, {D 1 , D 2 } is a bipartite graphical sequence if and only if there is an n 1 1 n 2 matrix of 0's and 1's having d 1j 1 1's in row j 1 and