Linear secret sharing schemes (LSSSs) are important building blocks for multi party computation (MPC). We discuss how established methods in coding theory can be used to analyse LSSSs and conversely how LSSSs provide a very natural generalized setting for such methods.