On nearly-MDS expander codes

A construction of graph codes is presented that approaches the singleton bound as the alphabet size goes to infinity. These codes can be decoded by a combined error-erasure decoder whose time complexity grows linearly with the code length.