Decoding algorithms for error-correcting codes typically take as input all symbols of a received word and attempt to determine the original codeword. In fractional decoding, only an alpha-proportion of symbols are used where alpha<1. Linear exact repair recovers erasures in codes over field extensions while limiting the amount of subsymbols shared over the network. In this talk, we will discuss such strategies for getting by with less, focusing on evaluation codes and codes from curves.