Capacity bounds for a three-node binary symmetric relay channel with orthogonal components at the destination are studied. The cut-set upper bound and the rates achievable using decode-and-forward (DF). partial DF and compress-and-forward (CF) relaying are first evaluated. Then relaying strategies with finite memory-length are considered. https://www.roneverhart.com/Castello-di-Amorosa-Il-Barone-Napa-Valley-Cabernet-Sauvignon-2007/