error-correcting codes are often used when data is transmitted over a channel in which noise can occur, thereby damaging some of the data. there are several types of error-correcting codes. in this talk, we will discuss an errorcorrecting code that is defined in terms of a particular finite geometry. this finite geometry comes from the incidence matrix of the so-called wenger graphs. these graphs are well-known to those working in extremal graph theory. the talk will begin with a brief introduction to error-correcting codes, followed by linear codes. we will then define the finite geometry, and discuss some progress on an open problem of cioab\u{a}, lazebnik, and li.