Judul: Smallholder Inclusiveness Analysis on Chili Value Chain in Agam Regency West Sumatra Province
Abstrak: Salah satu metode untuk mengembangkan petani kecil adalah dengan pendekatan model bisnis inklusif yang mengintegrasikan petani kecil ke dalam pasar dan rantai nilai pertanian. Penelitian ini bertujuan menganalisis rantai nilai cabai di Kecamatan Sungai Pua, menganalisis inklusivitas petani sebagai bagian dari rantai nilai tersebut, serta mengidentifikasi bidang perbaikan untuk meningkatkan inklusivitas petani. Ketiga tujuan tersebut dikaji dengan pemetaan rantai nilai, aktivitas rantai nilai, dan prinsip model bisnis baru. Metode yang digunakan adalah metode kuantitatif dan kualitatif. Hasil analisis rantai nilai menunjukkan kelemahan pada hubungan dengan mitra kerja yaitu Badan Penyuluh Pertanian (BPP), yang juga berdampak pada aktivitas rantai nilainya (aktivitas operasional). Analisis inklusivitas petani dinilai masih rendah. Prinsip dengan skor terendah yang menunjukkan kelemahan inklusivitas petani yaitu prinsip tata-kelola yang sesuai standar dan transparan, inovasi inklusif, dan pengukuran hasil. Oleh karena itu, bidang perbaikan yang dapat dilakukan adalah peningkatan proses dan fungsional pada mitra kerja, petani, kelompok tani, serta pemerintah., One method for smallholder development is an inclusive business model that integrates smallholder farmers into the market and into the agricultural value chain. This study aims to analyze the current chili value chain in Sungai Pua District, analyze smallholder inclusiveness as part of it, as well as the possible areas of improvement for farmer inclusiveness. Respectively used value chain map, value chain activities, and new business model (NBM) principles. This study used both quantitative and qualitative methods. The results from value chain analysis showed weaknesses in relationships with partners, which also affected its value chain activities (operational activities). The principles with the lowest score among six new business model principles were identified which indicates the weak areas of smallholder inclusiveness, those are fair and transparent governance, inclusive innovation, and measurement of outcomes. Therefore, it can be identified areas of improvement, namely through process and functional improvement of partners, farmers, farmer groups, and the government.
Keyword: bisnis inklusif, inklusivitas, petani kecil, prinsip model bisnis baru, rantai nilai, inclusive business, inclusiveness, new business model principles, smallholders, value chain

Judul: Inclusive Business Analysis of Arabica Coffee Value Chain in Lembang, West Bandung
Abstrak: Model bisnis inklusif melibatkan seluruh aktor dalam rantai nilai untuk mengentaskan kemiskinan dan meningkatkan kesejahteraan dengan mengintegrasikan petani kecil ke dalam rantai nilai. Tujuan dari penelitian adalah mengidentifikasi rantai nilai, menganalisis tingkat inklusivitas petani, dan menyusun strategi peningkatan keterlibatan petani Kopi Kelompok Tani Mekar Rahayu, Lembang Bandung Barat. Metode yang digunakan yaitu mix-method dengan link methodology mencakup pemetaan rantai nilai dan model bisnis kanvas serta kerangka SI-RCOV yaitu Strategic Intent (SI), Resource, Inclusive business models involve all actors in the value chain to alleviate poverty and improve welfare by integrating smallholder farmers into the value chain. The objectives of the study were to identify the value chain, analyze the level of inclusiveness of farmers, and develop strategies to increase the involvement of farmers in the Mekar Rahayu Farmer Group Coffee, Lembang, West Bandung. The method used is mix-method with link methodology including value chain mapping and business model canvas and SI-RCOV framework, namely Strategic Intent (SI), Resources
Keyword: Kopi, rantai nilai, Model Bisnis Inklusif, SI-RCOV

Judul: Construction of Strongly Optimal Binary Linear Code with Minimum Distance 9 and 11
Abstrak: A binary linear code of length n over q F is a subspace of n q F . A code has three parameters that attached to it, namely length, dimension, and minimum distance. A code with length n, dimension k and minimum distance d is often called [n, k, d ]-code. Usually, when two parameters are given, then we want to find a code that has the best value for the last parameter. Based on Gilbert- Varshamov bound, if a [n, k, d ]-code exists and can not be expanded, we call it a strongly optimal code. In this paper, we construct strongly optimal code with minimum distance 9 and 11. In constructing the code, we created a theorem and algorithm based on Gilbert-Varshamov bound before we implement the algorithm to MAPLE programming language. Because of computational limitations, the program can only construct up to k = 10 for d = 9 and k = 12 for d = 11.
Keyword: