Shaska, Tanush; Ustimenko, V. On some applications of graphs to cryptography and turbocoding. (English) Zbl 1198.94124 Albanian J. Math. 2, No. 3, 249-255 (2008). Summary: Families of simple graphs of high girth are used for the development of algorithms in cryptography and turbocoding. Recent results in that directions show the interest of applied researchers to “families of directed graphs of high girth”, but the concept of the girth for the directed graphs is not well established. We discuss one of the possible definition. It agrees well with the classical definition in the case of simple graph and allows to create the analog of extremal graph theory for simple graphs without small cycles for the class of balanced graphs i.e. directed graphs without multiple arrows such that each vertex has same number of inputs and outputs. Finally we discuss some explicit construction of simple and directed graphs which can be applicable to turbocoding and cryptography. Cited in 5 Documents MSC: 94A60 Cryptography 94B25 Combinatorial codes 05C90 Applications of graph theory Software:CRYPTIM PDFBibTeX XMLCite \textit{T. Shaska} and \textit{V. Ustimenko}, Albanian J. Math. 2, No. 3, 249--255 (2008; Zbl 1198.94124) Full Text: Link