Judul: Income Analysis of Pine Sap Tappers (Pinus merkusii) in RPH Sugihan, KPH Kediri
Abstrak: Pinus (Pinus merkusii) merupakan salah satu hasil hutan dengan kandungan getah yang bernilai ekonomi tinggi. Perum Perhutani melibatkan masyarakat sekitar hutan sebagai tenaga penyadap untuk meningkatkan produktivitas getah pinus serta kesejahteraan masyarakat. Penelitian ini bertujuan untuk menganalisis besar pendapatan petani penyadap getah pinus, menganalisis besar kontribusi pendapatan dari kegiatan penyadapan getah pinus terhadap pendapatan total, serta menganalisis karakteristik petani penyadap getah pinus di RPH Sugihan. Metode yang digunakan dalam pengambilan data adalah observasi, wawancara, dan dokumentasi. Hasil penelitian menunjukkan bahwa rata-rata pendapatan penyadap dari sektor sadapan getah pinus sebesar Rp 11.028.180,12 per tahun dengan persentase kontribusi 47,12% sedangkan rata-rata pendapatan dari sektor lain sebesar Rp 12.376.000 per tahun dengan persentase kontribusi 52,88% sehingga diperoleh pendapatan total per tahun sebesar Rp 23.404.180,12. Kegiatan sadapan getah pinus tetap berkontribusi terhadap pendapatan total dan dapat dimaksimalkan untuk meningkatkan pendapatan dan kesejahteraan penyadap., Pine (Pinus merkusii) is one of the forest products with high economic value sap content. Perum Perhutani involves the community around the forest as tappers to increase pine resin productivity and community welfare. This study aims to analyze the income of pine resin tappers, analyze the contribution of income from pine resin tapping activities to total income, and analyze the characteristics of pine resin tappers in RPH Sugihan. The methods used in data collection were observation, interview, and documentation. The results showed that the average income of tappers from the pine resin tapping sector was Rp 11.028.180,12 per year with a contribution percentage of 47,12% while the averageincome from other sectors was Rp 12.376.000 per year with a contribution percentage of 52,88% so that the total income per year was Rp 23.404.180,12. Pineresin tapping activities still contribute to total income and can be maximized to increase the income and welfare of tappers.
Keyword: pine resin, income, tappers

Judul: Kontribusi Pendapatan Penyadap Getah Pinus Tehadap Kesejahteraan Penyadap Di BKPH Lengkong, KPH Sukabumi, Perum Perhutani Divisi Regional Jawa Barat-Banten
Abstrak: Pine resin is one of non wood forest product which utilized in Perum Perhutani and has high economic value. Perum Perhutani involves community surrounding forest area as pine resin tapper which aimed to increase of pine resin productivity and their community of welfare. This research aimed to obtain information regarding the level of welfare tappers, identify the characteristics of the tappers, and calculate the contribution of income from pine resin tapping on total tapper income of tappers. The research was conducted at BKPH Lengkong, KPH Sukabumi, Perum Perhutani Divisi Regional West Java-Banten with 78 respondents. The research result showed that the activity of pine sap contributed 67.15% of the total revenue tapper. According poverty line of Sajogyo, approximately 79.49% tappers are above the poverty line, according to the poverty line of World Bank, about 93.59% tappers are above the poverty line, whereas according to the Sukabumi UMR, approximately 64.10% tappers are not welfare.
Keyword: Bogor Agricultural University (IPB), Pine Resin, Tapper, Contribution, Involves community

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: