  In this note we obtain upper bounds on the number of hyperedges in 3-uniform
hypergraphs not containing a Berge cycle of given odd length. We improve the
bound given by F\"uredi and \"Ozkahya in 2017. The result follows from a more
general theorem. We also obtain some new results for Berge cliques.
