Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE March 15, 2016 Abstract. Let C ⊆ [r]m be a code such that any two words of C have Hamming distance at least
Add to Reading List
Document Date: 2016-03-15 19:27:05
Open Document
File Size: 295,43 KB
Share Result on Facebook
ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE March 15, 2016 Abstract. Let C ⊆ [r]m be a code such that any two words of C have Hamming distance at least