By leveraging constructions from coding theory, we obtain improved lower bounds on the maximum number of edges in r-uniform hypergraphs with girth 5 and 6, for all r ≥ 3.
